Base | Representation |
---|---|
bin | 10001100111111011001… |
… | …100101101001100000010 |
3 | 11021210001122201211020120 |
4 | 101213323030231030002 |
5 | 124320313124102320 |
6 | 2324212144521110 |
7 | 153333123014634 |
oct | 21477314551402 |
9 | 4253048654216 |
10 | 1211100222210 |
11 | 42769655835a |
12 | 176877020196 |
13 | 8a28b203028 |
14 | 42890846a54 |
15 | 21784475440 |
hex | 119fb32d302 |
1211100222210 has 64 divisors (see below), whose sum is σ = 2988522238464. Its totient is φ = 313920230400.
The previous prime is 1211100222181. The next prime is 1211100222247. The reversal of 1211100222210 is 122220011121.
It is a super-2 number, since 2×12111002222102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1211100222210.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1483339 + ... + 2149998.
It is an arithmetic number, because the mean of its divisors is an integer number (46695659976).
Almost surely, 21211100222210 is an apocalyptic number.
1211100222210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1211100222210 is an abundant number, since it is smaller than the sum of its proper divisors (1777422016254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211100222210 is a wasteful number, since it uses less digits than its factorization.
1211100222210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3633659.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1211100222210 its reverse (122220011121), we get a palindrome (1333320233331).
The spelling of 1211100222210 in words is "one trillion, two hundred eleven billion, one hundred million, two hundred twenty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •