Base | Representation |
---|---|
bin | 1001011000111000100101… |
… | …1011100111100110111001 |
3 | 1100112212202102201011222101 |
4 | 2112032021123213212321 |
5 | 2323113213201143001 |
6 | 33542212223223401 |
7 | 2113551225215035 |
oct | 226161133474671 |
9 | 40485672634871 |
10 | 10323112131001 |
11 | 332000974742a |
12 | 11a8831447b61 |
13 | 59b608346597 |
14 | 2798d99cb1c5 |
15 | 12d7db6b0a01 |
hex | 963896e79b9 |
10323112131001 has 8 divisors (see below), whose sum is σ = 10375919488800. Its totient is φ = 10270437289728.
The previous prime is 10323112130993. The next prime is 10323112131029. The reversal of 10323112131001 is 10013121132301.
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 10323112131001 - 23 = 10323112130993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10323112131001.
It is not an unprimeable number, because it can be changed into a prime (10323112131901) 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, 32972931 + ... + 33284536.
It is an arithmetic number, because the mean of its divisors is an integer number (1296989936100).
Almost surely, 210323112131001 is an apocalyptic number.
It is an amenable number.
10323112131001 is a deficient number, since it is larger than the sum of its proper divisors (52807357799).
10323112131001 is an equidigital number, since it uses as much as digits as its factorization.
10323112131001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66258263.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10323112131001 its reverse (10013121132301), we get a palindrome (20336233263302).
The spelling of 10323112131001 in words is "ten trillion, three hundred twenty-three billion, one hundred twelve million, one hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •