Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …10100111101011010110 |
3 | 10120120000102002111210200 |
4 | 32230221112213223112 |
5 | 113022000321010402 |
6 | 2051554231201330 |
7 | 132654005532651 |
oct | 16545126475326 |
9 | 3516012074720 |
10 | 1010011110102 |
11 | 35a385a39105 |
12 | 1438b6816246 |
13 | 74322375c27 |
14 | 36c55c5c898 |
15 | 1b4155bb21c |
hex | eb295a7ad6 |
1010011110102 has 48 divisors (see below), whose sum is σ = 2227370973360. Its totient is φ = 330683860800.
The previous prime is 1010011110067. The next prime is 1010011110107. The reversal of 1010011110102 is 2010111100101.
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 (1010011110107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 129777 + ... + 1427187.
It is an arithmetic number, because the mean of its divisors is an integer number (46403561945).
Almost surely, 21010011110102 is an apocalyptic number.
1010011110102 is an abundant number, since it is smaller than the sum of its proper divisors (1217359863258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010011110102 is a wasteful number, since it uses less digits than its factorization.
1010011110102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1298189 (or 1298186 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1010011110102 its reverse (2010111100101), we get a palindrome (3020122210203).
The spelling of 1010011110102 in words is "one trillion, ten billion, eleven million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •