Base | Representation |
---|---|
bin | 1001001011111101100010… |
… | …0111011100100001111111 |
3 | 1022202122201012002212100100 |
4 | 2102333120213130201333 |
5 | 2310444024144111111 |
6 | 33252214330532143 |
7 | 2061531506110644 |
oct | 222773047344177 |
9 | 38678635085310 |
10 | 10101102332031 |
11 | 3244942a27527 |
12 | 11717b2897053 |
13 | 5836b7154229 |
14 | 26cc78737dcb |
15 | 127b45d24756 |
hex | 92fd89dc87f |
10101102332031 has 24 divisors (see below), whose sum is σ = 14727264873984. Its totient is φ = 6670940896080.
The previous prime is 10101102332021. The next prime is 10101102332033. The reversal of 10101102332031 is 13023320110101.
It is not a de Polignac number, because 10101102332031 - 26 = 10101102331967 is a prime.
It is a super-2 number, since 2×101011023320312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10101102331995 and 10101102332013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101102332033) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38418840 + ... + 38680866.
It is an arithmetic number, because the mean of its divisors is an integer number (613636036416).
Almost surely, 210101102332031 is an apocalyptic number.
10101102332031 is a deficient number, since it is larger than the sum of its proper divisors (4626162541953).
10101102332031 is a wasteful number, since it uses less digits than its factorization.
10101102332031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 302171 (or 302168 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10101102332031 its reverse (13023320110101), we get a palindrome (23124422442132).
The spelling of 10101102332031 in words is "ten trillion, one hundred one billion, one hundred two million, three hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •