Base | Representation |
---|---|
bin | 111000110110000010… |
… | …0001100101101001011 |
3 | 102200002102020102120111 |
4 | 1301230010030231023 |
5 | 4000000430433420 |
6 | 132025033135151 |
7 | 11551026635635 |
oct | 1615404145513 |
9 | 380072212514 |
10 | 122072124235 |
11 | 47852593796 |
12 | 1b7a985a4b7 |
13 | b685595099 |
14 | 5ca0617a55 |
15 | 3296d6345a |
hex | 1c6c10cb4b |
122072124235 has 4 divisors (see below), whose sum is σ = 146486549088. Its totient is φ = 97657699384.
The previous prime is 122072124221. The next prime is 122072124257. The reversal of 122072124235 is 532421270221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 532421270221 = 55807 ⋅9540403.
It is a cyclic number.
It is not a de Polignac number, because 122072124235 - 27 = 122072124107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122072124197 and 122072124206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12207212419 + ... + 12207212428.
It is an arithmetic number, because the mean of its divisors is an integer number (36621637272).
Almost surely, 2122072124235 is an apocalyptic number.
122072124235 is a deficient number, since it is larger than the sum of its proper divisors (24414424853).
122072124235 is an equidigital number, since it uses as much as digits as its factorization.
122072124235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24414424852.
The product of its (nonzero) digits is 13440, while the sum is 31.
Adding to 122072124235 its reverse (532421270221), we get a palindrome (654493394456).
The spelling of 122072124235 in words is "one hundred twenty-two billion, seventy-two million, one hundred twenty-four thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •