Base | Representation |
---|---|
bin | 1011101101100101011… |
… | …01011000110010111101 |
3 | 1102110202001102101002001 |
4 | 11312302231120302331 |
5 | 23043134112413041 |
6 | 504512431502301 |
7 | 41034411161122 |
oct | 5666255306275 |
9 | 1373661371061 |
10 | 402430201021 |
11 | 1457403a23a2 |
12 | 65bb1087991 |
13 | 2bc44c6c604 |
14 | 15698c44749 |
15 | a704e38131 |
hex | 5db2b58cbd |
402430201021 has 2 divisors, whose sum is σ = 402430201022. Its totient is φ = 402430201020.
The previous prime is 402430201013. The next prime is 402430201027. The reversal of 402430201021 is 120102034204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 379931700996 + 22498500025 = 616386^2 + 149995^2 .
It is a cyclic number.
It is not a de Polignac number, because 402430201021 - 23 = 402430201013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 402430201021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (402430201027) 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, 201215100510 + 201215100511.
It is an arithmetic number, because the mean of its divisors is an integer number (201215100511).
Almost surely, 2402430201021 is an apocalyptic number.
It is an amenable number.
402430201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
402430201021 is an equidigital number, since it uses as much as digits as its factorization.
402430201021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 402430201021 its reverse (120102034204), we get a palindrome (522532235225).
The spelling of 402430201021 in words is "four hundred two billion, four hundred thirty million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •