Base | Representation |
---|---|
bin | 1001001101101110000111… |
… | …0011010100110110001100 |
3 | 1022212112201012021001000002 |
4 | 2103123201303110312030 |
5 | 2311442421212243200 |
6 | 33314133102223432 |
7 | 2063651404260461 |
oct | 223334163246614 |
9 | 38775635231002 |
10 | 10131321212300 |
11 | 325673a779542 |
12 | 1177626b84b78 |
13 | 5864c1984182 |
14 | 270503c7b668 |
15 | 128813c86bd5 |
hex | 936e1cd4d8c |
10131321212300 has 36 divisors (see below), whose sum is σ = 22694159522496. Its totient is φ = 3921801758400.
The previous prime is 10131321212227. The next prime is 10131321212339. The reversal of 10131321212300 is 321212313101.
It is a happy number.
10131321212300 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 (20).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1634080967 + ... + 1634087166.
Almost surely, 210131321212300 is an apocalyptic number.
10131321212300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10131321212300 is an abundant number, since it is smaller than the sum of its proper divisors (12562838310196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131321212300 is a wasteful number, since it uses less digits than its factorization.
10131321212300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3268168178 (or 3268168171 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10131321212300 its reverse (321212313101), we get a palindrome (10452533525401).
The spelling of 10131321212300 in words is "ten trillion, one hundred thirty-one billion, three hundred twenty-one million, two hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •