Base | Representation |
---|---|
bin | 101111000101111101… |
… | …1111101101100000000 |
3 | 100200001001200220022122 |
4 | 1132023323331230000 |
5 | 3124104243000000 |
6 | 114243121423412 |
7 | 10210100550023 |
oct | 1361373755400 |
9 | 320031626278 |
10 | 101132000000 |
11 | 39987417499 |
12 | 17724a9ab68 |
13 | 96c91b5825 |
14 | 4c7552d1ba |
15 | 296d7e2085 |
hex | 178befdb00 |
101132000000 has 252 divisors, whose sum is σ = 255576572328. Its totient is φ = 39936000000.
The previous prime is 101131999967. The next prime is 101132000041. The reversal of 101132000000 is 231101.
It is a super-3 number, since 3×1011320000003 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 523999904 + ... + 524000096.
Almost surely, 2101132000000 is an apocalyptic number.
101132000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101132000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127788286164).
101132000000 is an abundant number, since it is smaller than the sum of its proper divisors (154444572328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101132000000 is an frugal number, since it uses more digits than its factorization.
101132000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370 (or 331 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 8.
Adding to 101132000000 its reverse (231101), we get a palindrome (101132231101).
The spelling of 101132000000 in words is "one hundred one billion, one hundred thirty-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •