Base | Representation |
---|---|
bin | 1001001101101101011010… |
… | …1010000101110100110101 |
3 | 1022212112020011102222002220 |
4 | 2103123112222011310311 |
5 | 2311442030331221401 |
6 | 33314102342552553 |
7 | 2063643644122035 |
oct | 223332652056465 |
9 | 38775204388086 |
10 | 10131134242101 |
11 | 3256654186014 |
12 | 1177594438759 |
13 | 58649200c812 |
14 | 2704c70cb8c5 |
15 | 128802653336 |
hex | 936d6a85d35 |
10131134242101 has 8 divisors (see below), whose sum is σ = 13583643677280. Its totient is φ = 6716357150832.
The previous prime is 10131134242081. The next prime is 10131134242111. The reversal of 10131134242101 is 10124243113101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10131134242101 - 25 = 10131134242069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131134242111) 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, 9433085350 + ... + 9433086423.
It is an arithmetic number, because the mean of its divisors is an integer number (1697955459660).
Almost surely, 210131134242101 is an apocalyptic number.
It is an amenable number.
10131134242101 is a deficient number, since it is larger than the sum of its proper divisors (3452509435179).
10131134242101 is a wasteful number, since it uses less digits than its factorization.
10131134242101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18866171955.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 10131134242101 its reverse (10124243113101), we get a palindrome (20255377355202).
The spelling of 10131134242101 in words is "ten trillion, one hundred thirty-one billion, one hundred thirty-four million, two hundred forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •