Base | Representation |
---|---|
bin | 1011000000010100000001… |
… | …0000101110111011110000 |
3 | 1120211202012212121022102122 |
4 | 2300011000100232323300 |
5 | 3041221300224014300 |
6 | 41422355210333412 |
7 | 2356124206340660 |
oct | 260050020567360 |
9 | 46752185538378 |
10 | 12100001001200 |
11 | 3945644134142 |
12 | 1435089a2a268 |
13 | 69a04348cc48 |
14 | 2db900c201a0 |
15 | 15eb372a6c85 |
hex | b014042eef0 |
12100001001200 has 60 divisors (see below), whose sum is σ = 33223145613840. Its totient is φ = 4148571770880.
The previous prime is 12100001001169. The next prime is 12100001001287. The reversal of 12100001001200 is 210010000121.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2160711665 + ... + 2160717264.
It is an arithmetic number, because the mean of its divisors is an integer number (553719093564).
Almost surely, 212100001001200 is an apocalyptic number.
12100001001200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12100001001200 is an abundant number, since it is smaller than the sum of its proper divisors (21123144612640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12100001001200 is a wasteful number, since it uses less digits than its factorization.
12100001001200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4321428954 (or 4321428943 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 12100001001200 its reverse (210010000121), we get a palindrome (12310011001321).
The spelling of 12100001001200 in words is "twelve trillion, one hundred billion, one million, one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.223 sec. • engine limits •