Base | Representation |
---|---|
bin | 1001001011111101101001… |
… | …0001000010100101011111 |
3 | 1022202122210010012012112021 |
4 | 2102333122101002211133 |
5 | 2310444103240404043 |
6 | 33252221200121011 |
7 | 2061532263310360 |
oct | 222773221024537 |
9 | 38678703165467 |
10 | 10101130013023 |
11 | 3244957613685 |
12 | 1171800006167 |
13 | 5836bcac680a |
14 | 26cc7c2a1b67 |
15 | 127b484913ed |
hex | 92fda44295f |
10101130013023 has 16 divisors (see below), whose sum is σ = 11663351691264. Its totient is φ = 8568712039680.
The previous prime is 10101130013017. The next prime is 10101130013033. The reversal of 10101130013023 is 32031003110101.
It is a cyclic number.
It is not a de Polignac number, because 10101130013023 - 25 = 10101130012991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101130012988 and 10101130013006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101130013033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81710886 + ... + 81834412.
It is an arithmetic number, because the mean of its divisors is an integer number (728959480704).
Almost surely, 210101130013023 is an apocalyptic number.
10101130013023 is a deficient number, since it is larger than the sum of its proper divisors (1562221678241).
10101130013023 is a wasteful number, since it uses less digits than its factorization.
10101130013023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244062.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10101130013023 its reverse (32031003110101), we get a palindrome (42132133123124).
The spelling of 10101130013023 in words is "ten trillion, one hundred one billion, one hundred thirty million, thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •