Base | Representation |
---|---|
bin | 1001011110101001110000… |
… | …1011111011100000100011 |
3 | 1100220100112210210000022121 |
4 | 2113222130023323200203 |
5 | 2331224142011024443 |
6 | 34055521520445111 |
7 | 2123660051043031 |
oct | 227523413734043 |
9 | 40810483700277 |
10 | 10422211033123 |
11 | 335904247033a |
12 | 1203a89479797 |
13 | 5a7a6c2669c6 |
14 | 28061b0c7551 |
15 | 13118b7534ed |
hex | 97a9c2fb823 |
10422211033123 has 4 divisors (see below), whose sum is σ = 10618856524368. Its totient is φ = 10225565541880.
The previous prime is 10422211033081. The next prime is 10422211033127. The reversal of 10422211033123 is 32133011222401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10422211033123 - 213 = 10422211024931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10422211033127) 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, 98322745543 + ... + 98322745648.
It is an arithmetic number, because the mean of its divisors is an integer number (2654714131092).
Almost surely, 210422211033123 is an apocalyptic number.
10422211033123 is a deficient number, since it is larger than the sum of its proper divisors (196645491245).
10422211033123 is an equidigital number, since it uses as much as digits as its factorization.
10422211033123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196645491244.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 10422211033123 its reverse (32133011222401), we get a palindrome (42555222255524).
The spelling of 10422211033123 in words is "ten trillion, four hundred twenty-two billion, two hundred eleven million, thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •