Base | Representation |
---|---|
bin | 1001001100101011000011… |
… | …1110001100110010010101 |
3 | 1022210211020210202220112022 |
4 | 2103022300332030302111 |
5 | 2311144040430010401 |
6 | 33301555051102525 |
7 | 2062443356365040 |
oct | 223126076146225 |
9 | 38724223686468 |
10 | 10113322110101 |
11 | 324a04374a671 |
12 | 1174043141a45 |
13 | 5848b39a9442 |
14 | 26d6b7605c57 |
15 | 12810da0971b |
hex | 932b0f8cc95 |
10113322110101 has 8 divisors (see below), whose sum is σ = 11576057661504. Its totient is φ = 8655080371200.
The previous prime is 10113322110097. The next prime is 10113322110161. The reversal of 10113322110101 is 10101122331101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10113322110101 - 22 = 10113322110097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10113322110101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113322110161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1123448300 + ... + 1123457301.
It is an arithmetic number, because the mean of its divisors is an integer number (1447007207688).
Almost surely, 210113322110101 is an apocalyptic number.
It is an amenable number.
10113322110101 is a deficient number, since it is larger than the sum of its proper divisors (1462735551403).
10113322110101 is an equidigital number, since it uses as much as digits as its factorization.
10113322110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2246906251.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10113322110101 its reverse (10101122331101), we get a palindrome (20214444441202).
The spelling of 10113322110101 in words is "ten trillion, one hundred thirteen billion, three hundred twenty-two million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •