Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …0011110111100000111110 |
3 | 1022102221120012002100002200 |
4 | 2101222202203313200332 |
5 | 2303000440241023402 |
6 | 33142310411332330 |
7 | 2052125105364516 |
oct | 221524243674076 |
9 | 38387505070080 |
10 | 10010001111102 |
11 | 320a2437378a3 |
12 | 11580091510a6 |
13 | 577c29144645 |
14 | 2686b54a0846 |
15 | 1255b2e7021c |
hex | 91aa28f783e |
10010001111102 has 48 divisors (see below), whose sum is σ = 22315327642608. Its totient is φ = 3241064171520.
The previous prime is 10010001110969. The next prime is 10010001111109. The reversal of 10010001111102 is 20111110001001.
10010001111102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (10010001111109) 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, 35585923 + ... + 35866110.
It is an arithmetic number, because the mean of its divisors is an integer number (464902659221).
Almost surely, 210010001111102 is an apocalyptic number.
10010001111102 is an abundant number, since it is smaller than the sum of its proper divisors (12305326531506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010001111102 is a wasteful number, since it uses less digits than its factorization.
10010001111102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71452265 (or 71452262 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10010001111102 its reverse (20111110001001), we get a palindrome (30121111112103).
The spelling of 10010001111102 in words is "ten trillion, ten billion, one million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •