Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001110010101101000001110 |
3 | 111010102122202120121101102202 |
4 | 112300223100032111220032 |
5 | 101110032344303020420 |
6 | 552522120254521502 |
7 | 30041062623203561 |
oct | 2660532016255016 |
9 | 433378676541382 |
10 | 100102001220110 |
11 | 2999402504259a |
12 | b288531806292 |
13 | 43b17694391a6 |
14 | 1aa0d699684d8 |
15 | b88d3955d575 |
hex | 5b0ad0395a0e |
100102001220110 has 8 divisors (see below), whose sum is σ = 180183602196216. Its totient is φ = 40040800488040.
The previous prime is 100102001220097. The next prime is 100102001220119. The reversal of 100102001220110 is 11022100201001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 100102001220091 and 100102001220100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102001220119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5005100060996 + ... + 5005100061015.
It is an arithmetic number, because the mean of its divisors is an integer number (22522950274527).
Almost surely, 2100102001220110 is an apocalyptic number.
100102001220110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100102001220110 is a deficient number, since it is larger than the sum of its proper divisors (80081600976106).
100102001220110 is a wasteful number, since it uses less digits than its factorization.
100102001220110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10010200122018.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100102001220110 its reverse (11022100201001), we get a palindrome (111124101421111).
The spelling of 100102001220110 in words is "one hundred trillion, one hundred two billion, one million, two hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •