Base | Representation |
---|---|
bin | 101111001011010111… |
… | …0110110011111000000 |
3 | 100200111200111100021111 |
4 | 1132112232312133000 |
5 | 3124442124041000 |
6 | 114313111333104 |
7 | 10214430146242 |
oct | 1362656663700 |
9 | 320450440244 |
10 | 101313112000 |
11 | 39a6a679631 |
12 | 17775681194 |
13 | 97278888a9 |
14 | 4c915d6092 |
15 | 297e669cba |
hex | 1796bb67c0 |
101313112000 has 112 divisors (see below), whose sum is σ = 254648073888. Its totient is φ = 39920179200.
The previous prime is 101313111973. The next prime is 101313112013. The reversal of 101313112000 is 211313101.
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, 441492 + ... + 630508.
Almost surely, 2101313112000 is an apocalyptic number.
101313112000 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 101313112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127324036944).
101313112000 is an abundant number, since it is smaller than the sum of its proper divisors (153334961888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101313112000 is an equidigital number, since it uses as much as digits as its factorization.
101313112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189111 (or 189091 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 101313112000 its reverse (211313101), we get a palindrome (101524425101).
The spelling of 101313112000 in words is "one hundred one billion, three hundred thirteen million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •