Base | Representation |
---|---|
bin | 11011110010100011010001… |
… | …011011011010110110111101 |
3 | 121000202020000210221002121100 |
4 | 123302203101123122312331 |
5 | 112004432304332013041 |
6 | 1111535333302323313 |
7 | 34513116604165443 |
oct | 3362432133326675 |
9 | 530666023832540 |
10 | 122221103001021 |
11 | 35a4175138a202 |
12 | 1185b328129539 |
13 | 532752904975b |
14 | 22277665a6b93 |
15 | e1e3b859d6b6 |
hex | 6f28d16dadbd |
122221103001021 has 24 divisors (see below), whose sum is σ = 179445063749120. Its totient is φ = 80140811162400.
The previous prime is 122221103000981. The next prime is 122221103001037. The reversal of 122221103001021 is 120100301122221.
122221103001021 is a `hidden beast` number, since 1 + 2 + 222 + 110 + 300 + 10 + 21 = 666.
It is not a de Polignac number, because 122221103001021 - 214 = 122221102984637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122221103000985 and 122221103001003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122221103001421) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4769640 + ... + 16345998.
Almost surely, 2122221103001021 is an apocalyptic number.
It is an amenable number.
122221103001021 is a deficient number, since it is larger than the sum of its proper divisors (57223960748099).
122221103001021 is a wasteful number, since it uses less digits than its factorization.
122221103001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11595657 (or 11595654 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 122221103001021 its reverse (120100301122221), we get a palindrome (242321404123242).
The spelling of 122221103001021 in words is "one hundred twenty-two trillion, two hundred twenty-one billion, one hundred three million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •