Base | Representation |
---|---|
bin | 111001000010010101… |
… | …1011101010110011001 |
3 | 102201011012021012120210 |
4 | 1302010223131112121 |
5 | 4001322134203314 |
6 | 132134024041333 |
7 | 11564202624066 |
oct | 1620453352631 |
9 | 381135235523 |
10 | 122485069209 |
11 | 47a446a0428 |
12 | 1b8a4003249 |
13 | b71ccb9819 |
14 | 5cdd3cbc6d |
15 | 32bd232559 |
hex | 1c84add599 |
122485069209 has 4 divisors (see below), whose sum is σ = 163313425616. Its totient is φ = 81656712804.
The previous prime is 122485069177. The next prime is 122485069219. The reversal of 122485069209 is 902960584221.
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: 902960584221 = 3 ⋅300986861407.
It is not a de Polignac number, because 122485069209 - 25 = 122485069177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (122485069219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20414178199 + ... + 20414178204.
It is an arithmetic number, because the mean of its divisors is an integer number (40828356404).
Almost surely, 2122485069209 is an apocalyptic number.
It is an amenable number.
122485069209 is a deficient number, since it is larger than the sum of its proper divisors (40828356407).
122485069209 is an equidigital number, since it uses as much as digits as its factorization.
122485069209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40828356406.
The product of its (nonzero) digits is 622080, while the sum is 48.
The spelling of 122485069209 in words is "one hundred twenty-two billion, four hundred eighty-five million, sixty-nine thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •