Base | Representation |
---|---|
bin | 11000001001001… |
… | …000001011111101 |
3 | 1001020011110200012 |
4 | 120021020023331 |
5 | 1312142433023 |
6 | 104105313005 |
7 | 13015556111 |
oct | 3011101375 |
9 | 1036143605 |
10 | 405046013 |
11 | 198702079 |
12 | b3795765 |
13 | 65bba2c8 |
14 | 3bb19741 |
15 | 2585d978 |
hex | 182482fd |
405046013 has 2 divisors, whose sum is σ = 405046014. Its totient is φ = 405046012.
The previous prime is 405046007. The next prime is 405046069. The reversal of 405046013 is 310640504.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 238455364 + 166590649 = 15442^2 + 12907^2 .
It is a cyclic number.
It is not a de Polignac number, because 405046013 - 228 = 136610557 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 405046013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (405046073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 202523006 + 202523007.
It is an arithmetic number, because the mean of its divisors is an integer number (202523007).
Almost surely, 2405046013 is an apocalyptic number.
It is an amenable number.
405046013 is a deficient number, since it is larger than the sum of its proper divisors (1).
405046013 is an equidigital number, since it uses as much as digits as its factorization.
405046013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 405046013 is about 20125.7549672056. The cubic root of 405046013 is about 739.8916404520.
Adding to 405046013 its reverse (310640504), we get a palindrome (715686517).
The spelling of 405046013 in words is "four hundred five million, forty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •