Base | Representation |
---|---|
bin | 111000110111100001… |
… | …0111101001001100101 |
3 | 102200012220022222121122 |
4 | 1301233002331021211 |
5 | 4000101231130041 |
6 | 132034021023325 |
7 | 11552204656253 |
oct | 1615702751145 |
9 | 380186288548 |
10 | 122122130021 |
11 | 47878838891 |
12 | 1b802554b45 |
13 | b692a52cc8 |
14 | 5ca71135d3 |
15 | 329b43ec4b |
hex | 1c6f0bd265 |
122122130021 has 4 divisors (see below), whose sum is σ = 127431787872. Its totient is φ = 116812472172.
The previous prime is 122122130003. The next prime is 122122130063. The reversal of 122122130021 is 120031221221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 120031221221 = 114343 ⋅1049747.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122122130021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122122132021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2654828891 + ... + 2654828936.
It is an arithmetic number, because the mean of its divisors is an integer number (31857946968).
Almost surely, 2122122130021 is an apocalyptic number.
It is an amenable number.
122122130021 is a deficient number, since it is larger than the sum of its proper divisors (5309657851).
122122130021 is an equidigital number, since it uses as much as digits as its factorization.
122122130021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5309657850.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 122122130021 its reverse (120031221221), we get a palindrome (242153351242).
The spelling of 122122130021 in words is "one hundred twenty-two billion, one hundred twenty-two million, one hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •