Base | Representation |
---|---|
bin | 101101101111110110001101… |
… | …101100011010001001011100 |
3 | 222101101112200022112110200112 |
4 | 231233312031230122021130 |
5 | 202332430321233210022 |
6 | 1551530020442345152 |
7 | 60244141353635210 |
oct | 5557661554321134 |
9 | 871345608473615 |
10 | 201200120210012 |
11 | 59121545644a60 |
12 | 1a695b211bb1b8 |
13 | 8836122745271 |
14 | 37981d00c0940 |
15 | 183da245c28e2 |
hex | b6fd8db1a25c |
201200120210012 has 48 divisors (see below), whose sum is σ = 438983450723328. Its totient is φ = 78389412534720.
The previous prime is 201200120209981. The next prime is 201200120210029. The reversal of 201200120210012 is 210012021002102.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 121787213 + ... + 123428219.
It is an arithmetic number, because the mean of its divisors is an integer number (9145488556736).
Almost surely, 2201200120210012 is an apocalyptic number.
201200120210012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201200120210012 is an abundant number, since it is smaller than the sum of its proper divisors (237783330513316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201200120210012 is a wasteful number, since it uses less digits than its factorization.
201200120210012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2039106 (or 2039104 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201200120210012 its reverse (210012021002102), we get a palindrome (411212141212114).
The spelling of 201200120210012 in words is "two hundred one trillion, two hundred billion, one hundred twenty million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •