Base | Representation |
---|---|
bin | 1001001101101110001100… |
… | …0011011000110011011110 |
3 | 1022212112202122202022202102 |
4 | 2103123203003120303132 |
5 | 2311442442100400110 |
6 | 33314135132125102 |
7 | 2063652050542262 |
oct | 223334303306336 |
9 | 38775678668672 |
10 | 10131342200030 |
11 | 3256750603977 |
12 | 1177632006792 |
13 | 5864c612204c |
14 | 2705069820a2 |
15 | 128815a305a5 |
hex | 936e30d8cde |
10131342200030 has 16 divisors (see below), whose sum is σ = 18236532306960. Its totient is φ = 4052511025152.
The previous prime is 10131342200003. The next prime is 10131342200033. The reversal of 10131342200030 is 3000224313101.
It is a junction number, because it is equal to n+sod(n) for n = 10131342199975 and 10131342200011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131342200033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1544099 + ... + 4758878.
It is an arithmetic number, because the mean of its divisors is an integer number (1139783269185).
Almost surely, 210131342200030 is an apocalyptic number.
10131342200030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131342200030 is a deficient number, since it is larger than the sum of its proper divisors (8105190106930).
10131342200030 is a wasteful number, since it uses less digits than its factorization.
10131342200030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6463723.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10131342200030 its reverse (3000224313101), we get a palindrome (13131566513131).
The spelling of 10131342200030 in words is "ten trillion, one hundred thirty-one billion, three hundred forty-two million, two hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •