Base | Representation |
---|---|
bin | 1001111011110000010000… |
… | …1000011001001000101101 |
3 | 1102200011000212221002012002 |
4 | 2132330010020121020231 |
5 | 2412422101303031301 |
6 | 35121324241022045 |
7 | 2205046403621660 |
oct | 236740410311055 |
9 | 42604025832162 |
10 | 10922171142701 |
11 | 3531080962545 |
12 | 1284959024925 |
13 | 612c58058a80 |
14 | 29a8c8cc56d7 |
15 | 13e19db0716b |
hex | 9ef0421922d |
10922171142701 has 32 divisors (see below), whose sum is σ = 14240885218560. Its totient is φ = 8129114274816.
The previous prime is 10922171142691. The next prime is 10922171142703. The reversal of 10922171142701 is 10724117122901.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10922171142701 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10922171142703) 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 31 ways as a sum of consecutive naturals, for example, 1098995 + ... + 4801263.
It is an arithmetic number, because the mean of its divisors is an integer number (445027663080).
Almost surely, 210922171142701 is an apocalyptic number.
It is an amenable number.
10922171142701 is a deficient number, since it is larger than the sum of its proper divisors (3318714075859).
10922171142701 is a wasteful number, since it uses less digits than its factorization.
10922171142701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3704213.
The product of its (nonzero) digits is 14112, while the sum is 38.
The spelling of 10922171142701 in words is "ten trillion, nine hundred twenty-two billion, one hundred seventy-one million, one hundred forty-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •