Base | Representation |
---|---|
bin | 1011000101110… |
… | …0011101001101 |
3 | 10020112021000111 |
4 | 2301130131031 |
5 | 43402003140 |
6 | 4341000021 |
7 | 1103244202 |
oct | 261343515 |
9 | 106467014 |
10 | 46516045 |
11 | 24291214 |
12 | 136b3011 |
13 | 98386b4 |
14 | 626bca9 |
15 | 413c7ea |
hex | 2c5c74d |
46516045 has 4 divisors (see below), whose sum is σ = 55819260. Its totient is φ = 37212832.
The previous prime is 46516039. The next prime is 46516049. The reversal of 46516045 is 54061564.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6295081 + 40220964 = 2509^2 + 6342^2 .
It is a cyclic number.
It is not a de Polignac number, because 46516045 - 29 = 46515533 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 46515998 and 46516016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46516049) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4651600 + ... + 4651609.
It is an arithmetic number, because the mean of its divisors is an integer number (13954815).
Almost surely, 246516045 is an apocalyptic number.
It is an amenable number.
46516045 is a deficient number, since it is larger than the sum of its proper divisors (9303215).
46516045 is an equidigital number, since it uses as much as digits as its factorization.
46516045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9303214.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 46516045 is about 6820.2672235038. The cubic root of 46516045 is about 359.6396729020.
The spelling of 46516045 in words is "forty-six million, five hundred sixteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •