Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1001111010111010010111 |
3 | 1022102002100120221011101200 |
4 | 2101202022221322322113 |
5 | 2302324032042010403 |
6 | 33134222311123543 |
7 | 2051356232213565 |
oct | 221421251727227 |
9 | 38362316834350 |
10 | 10001010110103 |
11 | 320644a532761 |
12 | 115631a0735b3 |
13 | 5771254c53cc |
14 | 2680a134ca35 |
15 | 12523896eca3 |
hex | 9188aa7ae97 |
10001010110103 has 12 divisors (see below), whose sum is σ = 15295662521568. Its totient is φ = 6275143598400.
The previous prime is 10001010110101. The next prime is 10001010110153. The reversal of 10001010110103 is 30101101010001.
10001010110103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10001010110103 - 21 = 10001010110101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001010110101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32683039423 + ... + 32683039728.
It is an arithmetic number, because the mean of its divisors is an integer number (1274638543464).
Almost surely, 210001010110103 is an apocalyptic number.
10001010110103 is a deficient number, since it is larger than the sum of its proper divisors (5294652411465).
10001010110103 is a wasteful number, since it uses less digits than its factorization.
10001010110103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65366079174 (or 65366079171 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 10001010110103 its reverse (30101101010001), we get a palindrome (40102111120104).
The spelling of 10001010110103 in words is "ten trillion, one billion, ten million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •