Base | Representation |
---|---|
bin | 101101101110100011011010… |
… | …1000111101101110110010000 |
3 | 1221202011002101210021121200011 |
4 | 1123131012311013231312100 |
5 | 410210003014314031000 |
6 | 3543242233420204304 |
7 | 150502416541515610 |
oct | 13335066507556620 |
9 | 1852132353247604 |
10 | 402222431002000 |
11 | 107184636424464 |
12 | 3914149a399694 |
13 | 1435854932a92b |
14 | 71479532b0a40 |
15 | 3177add9482ba |
hex | 16dd1b51edd90 |
402222431002000 has 320 divisors, whose sum is σ = 1127918256611328. Its totient is φ = 135872022720000.
The previous prime is 402222431001983. The next prime is 402222431002013. The reversal of 402222431002000 is 200134222204.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1501800099 + ... + 1502067901.
Almost surely, 2402222431002000 is an apocalyptic number.
402222431002000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 402222431002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (563959128305664).
402222431002000 is an abundant number, since it is smaller than the sum of its proper divisors (725695825609328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402222431002000 is a wasteful number, since it uses less digits than its factorization.
402222431002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269415 (or 269399 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 22.
Adding to 402222431002000 its reverse (200134222204), we get a palindrome (402422565224204).
The spelling of 402222431002000 in words is "four hundred two trillion, two hundred twenty-two billion, four hundred thirty-one million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •