Base | Representation |
---|---|
bin | 111000111010011110… |
… | …0100100101000010101 |
3 | 102200110210121012100221 |
4 | 1301310330210220111 |
5 | 4000302101320041 |
6 | 132051514434341 |
7 | 11554516243660 |
oct | 1616474445025 |
9 | 380423535327 |
10 | 122221120021 |
11 | 479196aa500 |
12 | 1b82b7329b1 |
13 | b6aa401b80 |
14 | 5cb63206d7 |
15 | 32a4e952d1 |
hex | 1c74f24a15 |
122221120021 has 24 divisors (see below), whose sum is σ = 165344289152. Its totient is φ = 87911287200.
The previous prime is 122221120003. The next prime is 122221120027. The reversal of 122221120021 is 120021122221.
It is a happy number.
It is not a de Polignac number, because 122221120021 - 27 = 122221119893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122221119977 and 122221120004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122221120027) 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, 5538945 + ... + 5560966.
Almost surely, 2122221120021 is an apocalyptic number.
122221120021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122221120021 is a deficient number, since it is larger than the sum of its proper divisors (43123169131).
122221120021 is a wasteful number, since it uses less digits than its factorization.
122221120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11099953 (or 11099942 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 122221120021 its reverse (120021122221), we get a palindrome (242242242242).
It can be divided in two parts, 122221 and 120021, that added together give a palindrome (242242).
The spelling of 122221120021 in words is "one hundred twenty-two billion, two hundred twenty-one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •