Base | Representation |
---|---|
bin | 1001001011111001110101… |
… | …1110011000101001101110 |
3 | 1022202120011001001022101200 |
4 | 2102332131132120221232 |
5 | 2310440011141213402 |
6 | 33251532043550330 |
7 | 2061465100225260 |
oct | 222763536305156 |
9 | 38676131038350 |
10 | 10100110101102 |
11 | 324448392a76a |
12 | 117157652b3a6 |
13 | 583589707338 |
14 | 26cbc2a4db30 |
15 | 127ad8b7a21c |
hex | 92f9d798a6e |
10100110101102 has 48 divisors (see below), whose sum is σ = 25010227188960. Its totient is φ = 2885696041536.
The previous prime is 10100110101079. The next prime is 10100110101121. The reversal of 10100110101102 is 20110101100101.
It is a super-2 number, since 2×101001101011022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6992424 + ... + 8312292.
It is an arithmetic number, because the mean of its divisors is an integer number (521046399770).
Almost surely, 210100110101102 is an apocalyptic number.
10100110101102 is an abundant number, since it is smaller than the sum of its proper divisors (14910117087858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100110101102 is a wasteful number, since it uses less digits than its factorization.
10100110101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1380617 (or 1380614 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10100110101102 its reverse (20110101100101), we get a palindrome (30210211201203).
The spelling of 10100110101102 in words is "ten trillion, one hundred billion, one hundred ten million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •