Base | Representation |
---|---|
bin | 111000110110111001… |
… | …1100101101010000111 |
3 | 102200011110011221200221 |
4 | 1301231303211222013 |
5 | 4000030414340143 |
6 | 132031555045211 |
7 | 11551533063451 |
oct | 1615563455207 |
9 | 380143157627 |
10 | 122101324423 |
11 | 47868018281 |
12 | 1b7b75a0807 |
13 | b68b649cc0 |
14 | 5ca44592d1 |
15 | 32996d02ed |
hex | 1c6dce5a87 |
122101324423 has 4 divisors (see below), whose sum is σ = 131493734008. Its totient is φ = 112708914840.
The previous prime is 122101324417. The next prime is 122101324441. The reversal of 122101324423 is 324423101221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 324423101221 = 23 ⋅14105352227.
It is a cyclic number.
It is not a de Polignac number, because 122101324423 - 225 = 122067769991 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122101324453) 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, 4696204773 + ... + 4696204798.
It is an arithmetic number, because the mean of its divisors is an integer number (32873433502).
Almost surely, 2122101324423 is an apocalyptic number.
122101324423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
122101324423 is a deficient number, since it is larger than the sum of its proper divisors (9392409585).
122101324423 is an equidigital number, since it uses as much as digits as its factorization.
122101324423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9392409584.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 122101324423 its reverse (324423101221), we get a palindrome (446524425644).
The spelling of 122101324423 in words is "one hundred twenty-two billion, one hundred one million, three hundred twenty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •