Base | Representation |
---|---|
bin | 111000011100101100… |
… | …1100111101111110101 |
3 | 102120220011202211021200 |
4 | 1300321121213233311 |
5 | 3441230324231010 |
6 | 131404430203113 |
7 | 11520665603004 |
oct | 1607131475765 |
9 | 376804684250 |
10 | 121222102005 |
11 | 47456797484 |
12 | 1b5b1053499 |
13 | b57b449954 |
14 | 5c1d78ac3b |
15 | 3247409cc0 |
hex | 1c39667bf5 |
121222102005 has 12 divisors (see below), whose sum is σ = 210118310220. Its totient is φ = 64651787712.
The previous prime is 121222101991. The next prime is 121222102021. The reversal of 121222102005 is 500201222121.
It can be written as a sum of positive squares in 2 ways, for example, as 69574085361 + 51648016644 = 263769^2 + 227262^2 .
It is not a de Polignac number, because 121222102005 - 26 = 121222101941 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1346912200 + ... + 1346912289.
It is an arithmetic number, because the mean of its divisors is an integer number (17509859185).
Almost surely, 2121222102005 is an apocalyptic number.
121222102005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
121222102005 is a deficient number, since it is larger than the sum of its proper divisors (88896208215).
121222102005 is a wasteful number, since it uses less digits than its factorization.
121222102005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2693824500 (or 2693824497 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 121222102005 its reverse (500201222121), we get a palindrome (621423324126).
The spelling of 121222102005 in words is "one hundred twenty-one billion, two hundred twenty-two million, one hundred two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •