Base | Representation |
---|---|
bin | 10001110000010100001… |
… | …110010100111100110100 |
3 | 11022122022120020120121120 |
4 | 101300110032110330310 |
5 | 124442241130342322 |
6 | 2332302155543540 |
7 | 154102314662160 |
oct | 21602416247464 |
9 | 4278276216546 |
10 | 1220110012212 |
11 | 43049a3259a3 |
12 | 17857045abb0 |
13 | 8b095a00410 |
14 | 430a7289ca0 |
15 | 21b10437a5c |
hex | 11c14394f34 |
1220110012212 has 96 divisors (see below), whose sum is σ = 3598605948672. Its totient is φ = 313090292736.
The previous prime is 1220110012193. The next prime is 1220110012217. The reversal of 1220110012212 is 2122100110221.
It is a junction number, because it is equal to n+sod(n) for n = 1220110012191 and 1220110012200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220110012217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15058473 + ... + 15139280.
It is an arithmetic number, because the mean of its divisors is an integer number (37485478632).
Almost surely, 21220110012212 is an apocalyptic number.
1220110012212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1220110012212 is an abundant number, since it is smaller than the sum of its proper divisors (2378495936460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220110012212 is a wasteful number, since it uses less digits than its factorization.
1220110012212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30197817 (or 30197815 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1220110012212 its reverse (2122100110221), we get a palindrome (3342210122433).
The spelling of 1220110012212 in words is "one trillion, two hundred twenty billion, one hundred ten million, twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •