Base | Representation |
---|---|
bin | 1001010010011000000011… |
… | …1010100100111111011101 |
3 | 1100011012011001122121021010 |
4 | 2110212000322210333131 |
5 | 2314300220311231414 |
6 | 33415001223325433 |
7 | 2102512351520361 |
oct | 224460072447735 |
9 | 40135131577233 |
10 | 10211300102109 |
11 | 3287651777187 |
12 | 118b0278b0879 |
13 | 590bc9607442 |
14 | 27432dcbd2a1 |
15 | 12a945485959 |
hex | 94980ea4fdd |
10211300102109 has 8 divisors (see below), whose sum is σ = 13749869444832. Its totient is φ = 6740132080400.
The previous prime is 10211300102083. The next prime is 10211300102119. The reversal of 10211300102109 is 90120100311201.
It is a happy number.
10211300102109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10211300102109 - 28 = 10211300101853 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211300102119) 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, 16850329899 + ... + 16850330504.
It is an arithmetic number, because the mean of its divisors is an integer number (1718733680604).
Almost surely, 210211300102109 is an apocalyptic number.
It is an amenable number.
10211300102109 is a deficient number, since it is larger than the sum of its proper divisors (3538569342723).
10211300102109 is a wasteful number, since it uses less digits than its factorization.
10211300102109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33700660507.
The product of its (nonzero) digits is 108, while the sum is 21.
The spelling of 10211300102109 in words is "ten trillion, two hundred eleven billion, three hundred million, one hundred two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •