Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …111110010110110010101 |
3 | 10221022021100100021022021 |
4 | 100023220133302312111 |
5 | 121204340031224341 |
6 | 2210502522333141 |
7 | 143224310560666 |
oct | 20135037626625 |
9 | 3838240307267 |
10 | 1112002211221 |
11 | 399663292a20 |
12 | 15b61b35a1b1 |
13 | 80b275353c5 |
14 | 3bb6d4dd36d |
15 | 1ddd450b9d1 |
hex | 102e87f2d95 |
1112002211221 has 64 divisors (see below), whose sum is σ = 1287853572096. Its totient is φ = 950339174400.
The previous prime is 1112002211213. The next prime is 1112002211227. The reversal of 1112002211221 is 1221122002111.
It is not a de Polignac number, because 1112002211221 - 23 = 1112002211213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112002211195 and 1112002211204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112002211227) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2568134221 + ... + 2568134653.
It is an arithmetic number, because the mean of its divisors is an integer number (20122712064).
Almost surely, 21112002211221 is an apocalyptic number.
1112002211221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1112002211221 is a deficient number, since it is larger than the sum of its proper divisors (175851360875).
1112002211221 is a wasteful number, since it uses less digits than its factorization.
1112002211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1162.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1112002211221 its reverse (1221122002111), we get a palindrome (2333124213332).
The spelling of 1112002211221 in words is "one trillion, one hundred twelve billion, two million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •