Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1110110001100100000 |
3 | 100120101211212121221200 |
4 | 1131033001312030200 |
5 | 3120011143211000 |
6 | 113553455321200 |
7 | 10142552040024 |
oct | 1351701661440 |
9 | 316354777850 |
10 | 100110132000 |
11 | 3950261798a |
12 | 1749a820200 |
13 | 959558cbc8 |
14 | 4bb992c384 |
15 | 290dc41500 |
hex | 174f076320 |
100110132000 has 144 divisors (see below), whose sum is σ = 355290986232. Its totient is φ = 26696025600.
The previous prime is 100110131977. The next prime is 100110132013. The reversal of 100110132000 is 231011001.
It can be written as a sum of positive squares in 4 ways, for example, as 40821777936 + 59288354064 = 202044^2 + 243492^2 .
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1354419 + ... + 1426418.
Almost surely, 2100110132000 is an apocalyptic number.
100110132000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100110132000 is an abundant number, since it is smaller than the sum of its proper divisors (255180854232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100110132000 is a wasteful number, since it uses less digits than its factorization.
100110132000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2780868 (or 2780847 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 100110132000 its reverse (231011001), we get a palindrome (100341143001).
The spelling of 100110132000 in words is "one hundred billion, one hundred ten million, one hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •