Base | Representation |
---|---|
bin | 1001001100000010000010… |
… | …0110110000001110011111 |
3 | 1022202202211100202100101211 |
4 | 2103000200212300032133 |
5 | 2311004012342010421 |
6 | 33252534233445251 |
7 | 2061603443052562 |
oct | 223004046601637 |
9 | 38682740670354 |
10 | 10102310110111 |
11 | 324540276602a |
12 | 1171a8b270827 |
13 | 58384a43cb0b |
14 | 26cd50cd04d9 |
15 | 127bb6d999e1 |
hex | 930209b039f |
10102310110111 has 8 divisors (see below), whose sum is σ = 10169410585824. Its totient is φ = 10035212236800.
The previous prime is 10102310110069. The next prime is 10102310110141. The reversal of 10102310110111 is 11101101320101.
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 10102310110111 - 239 = 9552554296223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10102310110091 and 10102310110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102310110141) 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, 7474875 + ... + 8722291.
It is an arithmetic number, because the mean of its divisors is an integer number (1271176323228).
Almost surely, 210102310110111 is an apocalyptic number.
10102310110111 is a deficient number, since it is larger than the sum of its proper divisors (67100475713).
10102310110111 is a wasteful number, since it uses less digits than its factorization.
10102310110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1301201.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 10102310110111 its reverse (11101101320101), we get a palindrome (21203411430212).
The spelling of 10102310110111 in words is "ten trillion, one hundred two billion, three hundred ten million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •