Base | Representation |
---|---|
bin | 10001011101110010000… |
… | …110100100111001100100 |
3 | 11020201221201020111012120 |
4 | 101131302012210321210 |
5 | 124131012302432322 |
6 | 2315211405545540 |
7 | 152466220251330 |
oct | 21356206447144 |
9 | 4221851214176 |
10 | 1200210202212 |
11 | 42300840812a |
12 | 174737b752b0 |
13 | 89244004908 |
14 | 4213a4047c0 |
15 | 213483aca5c |
hex | 117721a4e64 |
1200210202212 has 48 divisors (see below), whose sum is σ = 3200622741120. Its totient is φ = 342910536192.
The previous prime is 1200210202153. The next prime is 1200210202237. The reversal of 1200210202212 is 2122020120021.
It is a junction number, because it is equal to n+sod(n) for n = 1200210202191 and 1200210202200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5624818 + ... + 5834294.
It is an arithmetic number, because the mean of its divisors is an integer number (66679640440).
Almost surely, 21200210202212 is an apocalyptic number.
1200210202212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1200210202212 is an abundant number, since it is smaller than the sum of its proper divisors (2000412538908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200210202212 is a wasteful number, since it uses less digits than its factorization.
1200210202212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277700 (or 277698 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1200210202212 its reverse (2122020120021), we get a palindrome (3322230322233).
The spelling of 1200210202212 in words is "one trillion, two hundred billion, two hundred ten million, two hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •