Base | Representation |
---|---|
bin | 1001001011111110010001… |
… | …1001111101010110010111 |
3 | 1022202200012222021200120221 |
4 | 2102333210121331112113 |
5 | 2310444430312414111 |
6 | 33252250114135211 |
7 | 2061536430235045 |
oct | 222774431752627 |
9 | 38680188250527 |
10 | 10101300123031 |
11 | 3244a34640867 |
12 | 1171848b81507 |
13 | 583719116c20 |
14 | 26cc96b03395 |
15 | 127b58394371 |
hex | 92fe467d597 |
10101300123031 has 16 divisors (see below), whose sum is σ = 10975000395744. Its totient is φ = 9241417027584.
The previous prime is 10101300122981. The next prime is 10101300123041. The reversal of 10101300123031 is 13032100310101.
It is a cyclic number.
It is not a de Polignac number, because 10101300123031 - 213 = 10101300114839 is a prime.
It is a super-2 number, since 2×101013001230312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10101300122996 and 10101300123014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101300123041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44643175 + ... + 44868871.
It is an arithmetic number, because the mean of its divisors is an integer number (685937524734).
Almost surely, 210101300123031 is an apocalyptic number.
10101300123031 is a deficient number, since it is larger than the sum of its proper divisors (873700272713).
10101300123031 is a wasteful number, since it uses less digits than its factorization.
10101300123031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256290.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10101300123031 its reverse (13032100310101), we get a palindrome (23133400433132).
The spelling of 10101300123031 in words is "ten trillion, one hundred one billion, three hundred million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •