Base | Representation |
---|---|
bin | 1011101101100001110… |
… | …1011110001010101100 |
3 | 201020022222111002020000 |
4 | 2323120131132022230 |
5 | 11244024211200022 |
6 | 232232520224300 |
7 | 20351632426602 |
oct | 2733035361254 |
9 | 636288432200 |
10 | 201200100012 |
11 | 7836823609a |
12 | 32bb160b090 |
13 | 15c85b4a022 |
14 | 9a49639872 |
15 | 53789ce6ac |
hex | 2ed875e2ac |
201200100012 has 120 divisors (see below), whose sum is σ = 558021488640. Its totient is φ = 63036338400.
The previous prime is 201200099957. The next prime is 201200100077. The reversal of 201200100012 is 210001002102.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 201200099967 and 201200100003.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 653137 + ... + 910487.
It is an arithmetic number, because the mean of its divisors is an integer number (4650179072).
Almost surely, 2201200100012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201200100012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (279010744320).
201200100012 is an abundant number, since it is smaller than the sum of its proper divisors (356821388628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201200100012 is a wasteful number, since it uses less digits than its factorization.
201200100012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257513 (or 257502 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 201200100012 its reverse (210001002102), we get a palindrome (411201102114).
The spelling of 201200100012 in words is "two hundred one billion, two hundred million, one hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •