Base | Representation |
---|---|
bin | 1001001101101101010010… |
… | …1100110011110101100111 |
3 | 1022212112010212122102210110 |
4 | 2103123110230303311213 |
5 | 2311441443424303143 |
6 | 33314055211024103 |
7 | 2063643065016513 |
oct | 223332454636547 |
9 | 38775125572713 |
10 | 10131101400423 |
11 | 3256637694633 |
12 | 117758543b033 |
13 | 586488281283 |
14 | 2704c29bd143 |
15 | 1287ee817533 |
hex | 936d4b33d67 |
10131101400423 has 8 divisors (see below), whose sum is σ = 13543404484608. Its totient is φ = 6736432958264.
The previous prime is 10131101400403. The next prime is 10131101400461. The reversal of 10131101400423 is 32400410113101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10131101400423 - 26 = 10131101400359 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10131101400423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131101400403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4408659165 + ... + 4408661462.
It is an arithmetic number, because the mean of its divisors is an integer number (1692925560576).
Almost surely, 210131101400423 is an apocalyptic number.
10131101400423 is a deficient number, since it is larger than the sum of its proper divisors (3412303084185).
10131101400423 is an equidigital number, since it uses as much as digits as its factorization.
10131101400423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8817321013.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 10131101400423 its reverse (32400410113101), we get a palindrome (42531511513524).
The spelling of 10131101400423 in words is "ten trillion, one hundred thirty-one billion, one hundred one million, four hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •