Base | Representation |
---|---|
bin | 1011101001101001001… |
… | …00110101011110111101 |
3 | 1102021021120110202012001 |
4 | 11310310210311132331 |
5 | 23024320342430023 |
6 | 503522434542301 |
7 | 40631104053262 |
oct | 5646444653675 |
9 | 1367246422161 |
10 | 400314030013 |
11 | 144854919837 |
12 | 65700437991 |
13 | 2b99870c111 |
14 | 15537b89269 |
15 | a62e2796ad |
hex | 5d349357bd |
400314030013 has 2 divisors, whose sum is σ = 400314030014. Its totient is φ = 400314030012.
The previous prime is 400314029963. The next prime is 400314030131. The reversal of 400314030013 is 310030413004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 397981816164 + 2332213849 = 630858^2 + 48293^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-400314030013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (400314034013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200157015006 + 200157015007.
It is an arithmetic number, because the mean of its divisors is an integer number (200157015007).
Almost surely, 2400314030013 is an apocalyptic number.
It is an amenable number.
400314030013 is a deficient number, since it is larger than the sum of its proper divisors (1).
400314030013 is an equidigital number, since it uses as much as digits as its factorization.
400314030013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 400314030013 its reverse (310030413004), we get a palindrome (710344443017).
It can be divided in two parts, 400 and 314030013, that added together give a palindrome (314030413).
The spelling of 400314030013 in words is "four hundred billion, three hundred fourteen million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •