Base | Representation |
---|---|
bin | 1011000111011011000100… |
… | …0001110111011011110011 |
3 | 1121021102111210021200011100 |
4 | 2301312301001313123303 |
5 | 3100221431403413210 |
6 | 41554440142415443 |
7 | 2401010214662301 |
oct | 261666101673363 |
9 | 47242453250140 |
10 | 12222152013555 |
11 | 39924271a9720 |
12 | 1454899b91583 |
13 | 6a870c1b6293 |
14 | 3037abad1271 |
15 | 162dd5eee5c0 |
hex | b1db10776f3 |
12222152013555 has 96 divisors (see below), whose sum is σ = 23266897617600. Its totient is φ = 5885978480640.
The previous prime is 12222152013551. The next prime is 12222152013601. The reversal of 12222152013555 is 55531025122221.
12222152013555 is a `hidden beast` number, since 1 + 2 + 22 + 21 + 52 + 0 + 13 + 555 = 666.
It is not a de Polignac number, because 12222152013555 - 22 = 12222152013551 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12222152013551) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 89763087 + ... + 89899143.
It is an arithmetic number, because the mean of its divisors is an integer number (242363516850).
Almost surely, 212222152013555 is an apocalyptic number.
12222152013555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12222152013555 is a deficient number, since it is larger than the sum of its proper divisors (11044745604045).
12222152013555 is a wasteful number, since it uses less digits than its factorization.
12222152013555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137301 (or 137298 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
Adding to 12222152013555 its reverse (55531025122221), we get a palindrome (67753177135776).
The spelling of 12222152013555 in words is "twelve trillion, two hundred twenty-two billion, one hundred fifty-two million, thirteen thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •