Base | Representation |
---|---|
bin | 111000111101100000… |
… | …1101010111111100111 |
3 | 102200201220112100011202 |
4 | 1301323001222333213 |
5 | 4001004204320403 |
6 | 132110000553115 |
7 | 11560165236212 |
oct | 1617301527747 |
9 | 380656470152 |
10 | 122323120103 |
11 | 47971237698 |
12 | 1b85992279b |
13 | b6c5595b52 |
14 | 5cc5ab2779 |
15 | 32adde2688 |
hex | 1c7b06afe7 |
122323120103 has 4 divisors (see below), whose sum is σ = 122326046880. Its totient is φ = 122320193328.
The previous prime is 122323120063. The next prime is 122323120109. The reversal of 122323120103 is 301021323221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301021323221 = 117517 ⋅2561513.
It is a cyclic number.
It is not a de Polignac number, because 122323120103 - 214 = 122323103719 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 (122323120109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1399775 + ... + 1484592.
It is an arithmetic number, because the mean of its divisors is an integer number (30581511720).
Almost surely, 2122323120103 is an apocalyptic number.
122323120103 is a deficient number, since it is larger than the sum of its proper divisors (2926777).
122323120103 is an equidigital number, since it uses as much as digits as its factorization.
122323120103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2926776.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 122323120103 its reverse (301021323221), we get a palindrome (423344443324).
The spelling of 122323120103 in words is "one hundred twenty-two billion, three hundred twenty-three million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •