Base | Representation |
---|---|
bin | 101101101101000111000010… |
… | …000111101011001101100010 |
3 | 222100201120011101002022210121 |
4 | 231231013002013223031202 |
5 | 202321340104412241002 |
6 | 1551303351524150454 |
7 | 60224432162555050 |
oct | 5555070207531542 |
9 | 870646141068717 |
10 | 201012021212002 |
11 | 590597a06687a0 |
12 | 1a66558723842a |
13 | 8821476c08200 |
14 | 378d06880b1d0 |
15 | 1838bb5d66237 |
hex | b6d1c21eb362 |
201012021212002 has 384 divisors, whose sum is σ = 432774391283712. Its totient is φ = 67856076288000.
The previous prime is 201012021211999. The next prime is 201012021212017. The reversal of 201012021212002 is 200212120210102.
It is a happy number.
201012021212002 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 6831784263 + ... + 6831813685.
It is an arithmetic number, because the mean of its divisors is an integer number (1127016643968).
Almost surely, 2201012021212002 is an apocalyptic number.
201012021212002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201012021212002 is an abundant number, since it is smaller than the sum of its proper divisors (231762370071710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201012021212002 is a wasteful number, since it uses less digits than its factorization.
201012021212002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29706 (or 29693 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201012021212002 its reverse (200212120210102), we get a palindrome (401224141422104).
The spelling of 201012021212002 in words is "two hundred one trillion, twelve billion, twenty-one million, two hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •