Base | Representation |
---|---|
bin | 1001001100000000111010… |
… | …1110000000000100000101 |
3 | 1022202202001110002012022000 |
4 | 2103000032232000010011 |
5 | 2311002404031120401 |
6 | 33252444353455513 |
7 | 2061563140246566 |
oct | 223001656000405 |
9 | 38682043065260 |
10 | 10102010020101 |
11 | 324526932aa5a |
12 | 1171a06871599 |
13 | 58380021006c |
14 | 26cd230d616d |
15 | 127b9a86e186 |
hex | 9300eb80105 |
10102010020101 has 32 divisors (see below), whose sum is σ = 15701970723840. Its totient is φ = 6410582740800.
The previous prime is 10102010020087. The next prime is 10102010020111. The reversal of 10102010020101 is 10102001020101.
It is a happy number.
It is not a de Polignac number, because 10102010020101 - 210 = 10102010019077 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 (10102010020111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 98877690 + ... + 98979803.
It is an arithmetic number, because the mean of its divisors is an integer number (490686585120).
Almost surely, 210102010020101 is an apocalyptic number.
It is an amenable number.
10102010020101 is a deficient number, since it is larger than the sum of its proper divisors (5599960703739).
10102010020101 is a wasteful number, since it uses less digits than its factorization.
10102010020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197857594 (or 197857588 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10102010020101 its reverse (10102001020101), we get a palindrome (20204011040202).
Subtracting from 10102010020101 its reverse (10102001020101), we obtain a square (9000000 = 30002).
The spelling of 10102010020101 in words is "ten trillion, one hundred two billion, ten million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •