Base | Representation |
---|---|
bin | 101111001000111100… |
… | …1111011100000111110 |
3 | 100200022001010001000020 |
4 | 1132101321323200332 |
5 | 3124310411130420 |
6 | 114301055513010 |
7 | 10212424623366 |
oct | 1362171734076 |
9 | 320261101006 |
10 | 101232130110 |
11 | 39a28997751 |
12 | 17752528766 |
13 | 9713b73607 |
14 | 4c849559a6 |
15 | 29774c0340 |
hex | 1791e7b83e |
101232130110 has 32 divisors (see below), whose sum is σ = 243030951072. Its totient is φ = 26987030400.
The previous prime is 101232130091. The next prime is 101232130127. The reversal of 101232130110 is 11031232101.
It is a happy number.
It is a super-2 number, since 2×1012321301102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101232130110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 412089 + ... + 610148.
It is an arithmetic number, because the mean of its divisors is an integer number (7594717221).
Almost surely, 2101232130110 is an apocalyptic number.
101232130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101232130110 is an abundant number, since it is smaller than the sum of its proper divisors (141798820962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101232130110 is a wasteful number, since it uses less digits than its factorization.
101232130110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1025548.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 101232130110 its reverse (11031232101), we get a palindrome (112263362211).
The spelling of 101232130110 in words is "one hundred one billion, two hundred thirty-two million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •