Base | Representation |
---|---|
bin | 11011110010100100000110… |
… | …111101000000111001010101 |
3 | 121000202022100101200011122120 |
4 | 123302210012331000321111 |
5 | 112004441124224000041 |
6 | 1111540002341450153 |
7 | 34513151060101356 |
oct | 3362440675007125 |
9 | 530668311604576 |
10 | 122222001000021 |
11 | 35a4207227513a |
12 | 1185b538a10959 |
13 | 53276400c2400 |
14 | 222780d961d2d |
15 | e1e41c332366 |
hex | 6f2906f40e55 |
122222001000021 has 12 divisors (see below), whose sum is σ = 176462533988928. Its totient is φ = 75213539076624.
The previous prime is 122222000999981. The next prime is 122222001000031. The reversal of 122222001000021 is 120000100222221.
It is not a de Polignac number, because 122222001000021 - 214 = 122222000983637 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122222001000031) by changing a digit.
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, 120534517245 + ... + 120534518258.
It is an arithmetic number, because the mean of its divisors is an integer number (14705211165744).
Almost surely, 2122222001000021 is an apocalyptic number.
It is an amenable number.
122222001000021 is a deficient number, since it is larger than the sum of its proper divisors (54240532988907).
122222001000021 is a wasteful number, since it uses less digits than its factorization.
122222001000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241069035532 (or 241069035519 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 122222001000021 its reverse (120000100222221), we get a palindrome (242222101222242).
The spelling of 122222001000021 in words is "one hundred twenty-two trillion, two hundred twenty-two billion, one million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •