Base | Representation |
---|---|
bin | 101101101100111011110101… |
… | …101010111101111110001100 |
3 | 222100200102010200022110011100 |
4 | 231230323311222331332030 |
5 | 202321141000301400022 |
6 | 1551254043101423100 |
7 | 60223525256262240 |
oct | 5554736552757614 |
9 | 870612120273140 |
10 | 201000001200012 |
11 | 59054692688893 |
12 | 1a66319186aa90 |
13 | 88202ac887991 |
14 | 378c6482a0420 |
15 | 18387109911ac |
hex | b6cef5abdf8c |
201000001200012 has 144 divisors (see below), whose sum is σ = 599405351114752. Its totient is φ = 55575341982720.
The previous prime is 201000001199999. The next prime is 201000001200109. The reversal of 201000001200012 is 210002100000102.
It is a Harshad number since it is a multiple of its sum of digits (9).
201000001200012 is a modest number, since divided by 1200012 gives 20100 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 201000001199967 and 201000001200003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1155596883 + ... + 1155770805.
Almost surely, 2201000001200012 is an apocalyptic number.
It is an amenable number.
201000001200012 is an abundant number, since it is smaller than the sum of its proper divisors (398405349914740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201000001200012 is a wasteful number, since it uses less digits than its factorization.
201000001200012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321908 (or 321903 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 201000001200012 its reverse (210002100000102), we get a palindrome (411002101200114).
The spelling of 201000001200012 in words is "two hundred one trillion, one million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •