Base | Representation |
---|---|
bin | 10110110000110100100100… |
… | …001101000100110110111010 |
3 | 111010110121120102021121210022 |
4 | 112300310210031010312322 |
5 | 101110213334012010020 |
6 | 552530452401450442 |
7 | 30041565455313230 |
oct | 2660644415046672 |
9 | 433417512247708 |
10 | 100112000110010 |
11 | 29998296169569 |
12 | b28a462340a22 |
13 | 43b26a0b282a5 |
14 | 1aa16378bc950 |
15 | b8922229c625 |
hex | 5b0d24344dba |
100112000110010 has 64 divisors (see below), whose sum is σ = 210736844550144. Its totient is φ = 33525442036800.
The previous prime is 100112000109971. The next prime is 100112000110019. The reversal of 100112000110010 is 10011000211001.
It is a happy number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100112000110010.
It is not an unprimeable number, because it can be changed into a prime (100112000110019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 299541695 + ... + 299875725.
It is an arithmetic number, because the mean of its divisors is an integer number (3292763196096).
Almost surely, 2100112000110010 is an apocalyptic number.
100112000110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100112000110010 is an abundant number, since it is smaller than the sum of its proper divisors (110624844440134).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100112000110010 is a wasteful number, since it uses less digits than its factorization.
100112000110010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 433659.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100112000110010 its reverse (10011000211001), we get a palindrome (110123000321011).
The spelling of 100112000110010 in words is "one hundred trillion, one hundred twelve billion, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •