Base | Representation |
---|---|
bin | 10001011101110010000… |
… | …101110100000100100100 |
3 | 11020201221200212022212011 |
4 | 101131302011310010210 |
5 | 124131012230032322 |
6 | 2315211401404004 |
7 | 152466215456254 |
oct | 21356205640444 |
9 | 4221850768764 |
10 | 1200210002212 |
11 | 423008290941 |
12 | 174737a99604 |
13 | 89243c64880 |
14 | 4213a391964 |
15 | 2134836d677 |
hex | 11772174124 |
1200210002212 has 24 divisors (see below), whose sum is σ = 2263973959800. Its totient is φ = 553443553536.
The previous prime is 1200210002183. The next prime is 1200210002267. The reversal of 1200210002212 is 2122000120021.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 261822562596 + 938387439616 = 511686^2 + 968704^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 1200210002192 and 1200210002201.
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 7 ways as a sum of consecutive naturals, for example, 10348537 + ... + 10463872.
It is an arithmetic number, because the mean of its divisors is an integer number (94332248325).
Almost surely, 21200210002212 is an apocalyptic number.
It is an amenable number.
1200210002212 is a deficient number, since it is larger than the sum of its proper divisors (1063763957588).
1200210002212 is a wasteful number, since it uses less digits than its factorization.
1200210002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20813535 (or 20813533 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1200210002212 its reverse (2122000120021), we get a palindrome (3322210122233).
The spelling of 1200210002212 in words is "one trillion, two hundred billion, two hundred ten million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •