Base | Representation |
---|---|
bin | 1001001100000000111010… |
… | …1110101110101100011100 |
3 | 1022202202001110102220022001 |
4 | 2103000032232232230130 |
5 | 2311002404103223400 |
6 | 33252444401532044 |
7 | 2061563142003463 |
oct | 223001656565434 |
9 | 38682043386261 |
10 | 10102010211100 |
11 | 3245269450505 |
12 | 1171a06944024 |
13 | 583800278c92 |
14 | 26cd231459da |
15 | 127b9a8aaa6a |
hex | 9300ebaeb1c |
10102010211100 has 36 divisors (see below), whose sum is σ = 21946763692224. Its totient is φ = 4036121774080.
The previous prime is 10102010211079. The next prime is 10102010211113. The reversal of 10102010211100 is 111201020101.
It is a super-2 number, since 2×101020102111002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 58442149 + ... + 58614748.
It is an arithmetic number, because the mean of its divisors is an integer number (609632324784).
Almost surely, 210102010211100 is an apocalyptic number.
10102010211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10102010211100 is an abundant number, since it is smaller than the sum of its proper divisors (11844753481124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102010211100 is a wasteful number, since it uses less digits than its factorization.
10102010211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117057774 (or 117057767 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10102010211100 its reverse (111201020101), we get a palindrome (10213211231201).
The spelling of 10102010211100 in words is "ten trillion, one hundred two billion, ten million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •