Base | Representation |
---|---|
bin | 10010110111101110… |
… | …01000010101010100 |
3 | 222011001110212202112 |
4 | 21123313020111110 |
5 | 131222031111200 |
6 | 4353144530152 |
7 | 506026020320 |
oct | 113367102524 |
9 | 28131425675 |
10 | 10131113300 |
11 | 4329827410 |
12 | 1b68a80958 |
13 | c55c058c9 |
14 | 6c1732980 |
15 | 3e465b535 |
hex | 25bdc8554 |
10131113300 has 72 divisors (see below), whose sum is σ = 27409287360. Its totient is φ = 3157747200.
The previous prime is 10131113281. The next prime is 10131113323. The reversal of 10131113300 is 331113101.
It is a happy number.
10131113300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
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, 650165 + ... + 665564.
Almost surely, 210131113300 is an apocalyptic number.
10131113300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10131113300 is an abundant number, since it is smaller than the sum of its proper divisors (17278174060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131113300 is a wasteful number, since it uses less digits than its factorization.
10131113300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1315761 (or 1315754 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 10131113300 its reverse (331113101), we get a palindrome (10462226401).
The spelling of 10131113300 in words is "ten billion, one hundred thirty-one million, one hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •