Base | Representation |
---|---|
bin | 1001001101101101010010… |
… | …0111011110101011001101 |
3 | 1022212112010210000102220211 |
4 | 2103123110213132223031 |
5 | 2311441443100044041 |
6 | 33314055121042421 |
7 | 2063643050106454 |
oct | 223332447365315 |
9 | 38775123012824 |
10 | 10131100003021 |
11 | 325663691a758 |
12 | 1177584a86411 |
13 | 586487bb21ca |
14 | 2704c2737b9b |
15 | 1287ee63d481 |
hex | 936d49deacd |
10131100003021 has 8 divisors (see below), whose sum is σ = 10585258675200. Its totient is φ = 9678081002832.
The previous prime is 10131100003019. The next prime is 10131100003039. The reversal of 10131100003021 is 12030000113101.
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 10131100003021 - 21 = 10131100003019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10131100002992 and 10131100003010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131100003001) 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, 284899821 + ... + 284935378.
It is an arithmetic number, because the mean of its divisors is an integer number (1323157334400).
Almost surely, 210131100003021 is an apocalyptic number.
It is an amenable number.
10131100003021 is a deficient number, since it is larger than the sum of its proper divisors (454158672179).
10131100003021 is an equidigital number, since it uses as much as digits as its factorization.
10131100003021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569835995.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 10131100003021 its reverse (12030000113101), we get a palindrome (22161100116122).
The spelling of 10131100003021 in words is "ten trillion, one hundred thirty-one billion, one hundred million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •