Base | Representation |
---|---|
bin | 10110110000101010011010… |
… | …100000110110000111010100 |
3 | 111010102120102202222211220122 |
4 | 112300222122200312013110 |
5 | 101110024023111231400 |
6 | 552521451024451112 |
7 | 30041031401630426 |
oct | 2660523240660724 |
9 | 433376382884818 |
10 | 100101100102100 |
11 | 29993702417269 |
12 | b28831ba79a98 |
13 | 43b1654840976 |
14 | 1aa0cc1dda816 |
15 | b88cd53b0685 |
hex | 5b0a9a8361d4 |
100101100102100 has 36 divisors (see below), whose sum is σ = 217280975565024. Its totient is φ = 40029087350880.
The previous prime is 100101100102049. The next prime is 100101100102103. The reversal of 100101100102100 is 1201001101001.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100101100102103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 141554162 + ... + 142259561.
It is an arithmetic number, because the mean of its divisors is an integer number (6035582654584).
Almost surely, 2100101100102100 is an apocalyptic number.
100101100102100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100101100102100 is an abundant number, since it is smaller than the sum of its proper divisors (117179875462924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100101100102100 is a wasteful number, since it uses less digits than its factorization.
100101100102100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283817264 (or 283817257 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100101100102100 its reverse (1201001101001), we get a palindrome (101302101203101).
The spelling of 100101100102100 in words is "one hundred trillion, one hundred one billion, one hundred million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •