Base | Representation |
---|---|
bin | 11011110010100011001100… |
… | …100110011101111011011101 |
3 | 121000202012211011112101022200 |
4 | 123302203030212131323131 |
5 | 112004432123113323401 |
6 | 1111535321250402113 |
7 | 34513114601610306 |
oct | 3362431446357335 |
9 | 530665734471280 |
10 | 122221022011101 |
11 | 35a4170a6a2292 |
12 | 1185b304b90339 |
13 | 5327515330920 |
14 | 22277599237ad |
15 | e1e3b1401686 |
hex | 6f28cc99dedd |
122221022011101 has 48 divisors (see below), whose sum is σ = 191292765535872. Its totient is φ = 74749637462400.
The previous prime is 122221022011087. The next prime is 122221022011141. The reversal of 122221022011101 is 101110220122221.
122221022011101 is a `hidden beast` number, since 1 + 222 + 210 + 220 + 1 + 1 + 10 + 1 = 666.
It is not a de Polignac number, because 122221022011101 - 226 = 122220954902237 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122221022011141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1448228616 + ... + 1448313006.
It is an arithmetic number, because the mean of its divisors is an integer number (3985265948664).
Almost surely, 2122221022011101 is an apocalyptic number.
It is an amenable number.
122221022011101 is a deficient number, since it is larger than the sum of its proper divisors (69071743524771).
122221022011101 is a wasteful number, since it uses less digits than its factorization.
122221022011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160514 (or 160511 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 122221022011101 its reverse (101110220122221), we get a palindrome (223331242133322).
The spelling of 122221022011101 in words is "one hundred twenty-two trillion, two hundred twenty-one billion, twenty-two million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •