Base | Representation |
---|---|
bin | 101101101110100100001111… |
… | …010110001110100000001100 |
3 | 222101002010111010002102020020 |
4 | 231232210033112032200030 |
5 | 202330010040341320022 |
6 | 1551421342424022140 |
7 | 60234604230004365 |
oct | 5556441726164014 |
9 | 871063433072206 |
10 | 201112101120012 |
11 | 59098188111975 |
12 | 1a680a57901950 |
13 | 882aa361451a4 |
14 | 3793c4030cb6c |
15 | 183b5c20d735c |
hex | b6e90f58e80c |
201112101120012 has 48 divisors (see below), whose sum is σ = 481411899666432. Its totient is φ = 65322147113280.
The previous prime is 201112101119977. The next prime is 201112101120037. The reversal of 201112101120012 is 210021101211102.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 201112101119973 and 201112101120000.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 1283768908 + ... + 1283925555.
It is an arithmetic number, because the mean of its divisors is an integer number (10029414576384).
Almost surely, 2201112101120012 is an apocalyptic number.
It is an amenable number.
201112101120012 is an abundant number, since it is smaller than the sum of its proper divisors (280299798546420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201112101120012 is a wasteful number, since it uses less digits than its factorization.
201112101120012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2567694638 (or 2567694636 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201112101120012 its reverse (210021101211102), we get a palindrome (411133202331114).
The spelling of 201112101120012 in words is "two hundred one trillion, one hundred twelve billion, one hundred one million, one hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •