Base | Representation |
---|---|
bin | 1010111010100111101011… |
… | …0111100011110101110100 |
3 | 1120111101202221210012022000 |
4 | 2232221322313203311310 |
5 | 3033121001200310400 |
6 | 41305422355535300 |
7 | 2346062463543066 |
oct | 256517267436564 |
9 | 46441687705260 |
10 | 12002200010100 |
11 | 3908117010a73 |
12 | 141a1345ba530 |
13 | 690a58425a01 |
14 | 2d6ca3c5d736 |
15 | 15c311140600 |
hex | aea7ade3d74 |
12002200010100 has 144 divisors (see below), whose sum is σ = 40854547641600. Its totient is φ = 3012316853760.
The previous prime is 12002200010093. The next prime is 12002200010123. The reversal of 12002200010100 is 101000220021.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 130697020 + ... + 130788819.
It is an arithmetic number, because the mean of its divisors is an integer number (283712136400).
Almost surely, 212002200010100 is an apocalyptic number.
12002200010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12002200010100 is an abundant number, since it is smaller than the sum of its proper divisors (28852347631500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12002200010100 is a wasteful number, since it uses less digits than its factorization.
12002200010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261485879 (or 261485866 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 12002200010100 its reverse (101000220021), we get a palindrome (12103200230121).
The spelling of 12002200010100 in words is "twelve trillion, two billion, two hundred million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •