Base | Representation |
---|---|
bin | 1001001101101101010111… |
… | …1000110011000011000011 |
3 | 1022212112012021010110111102 |
4 | 2103123111320303003003 |
5 | 2311442014024221011 |
6 | 33314101202005015 |
7 | 2063643426232460 |
oct | 223332570630303 |
9 | 38775167113442 |
10 | 10131121320131 |
11 | 325664795a5a9 |
12 | 117759004676b |
13 | 58648c436c96 |
14 | 2704c54c6667 |
15 | 12880144e73b |
hex | 936d5e330c3 |
10131121320131 has 16 divisors (see below), whose sum is σ = 11978914856640. Its totient is φ = 8383512130560.
The previous prime is 10131121320097. The next prime is 10131121320137. The reversal of 10131121320131 is 13102312113101.
10131121320131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10131121320131 - 210 = 10131121319107 is a prime.
It is a super-2 number, since 2×101311213201312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10131121320137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 593606 + ... + 4540331.
It is an arithmetic number, because the mean of its divisors is an integer number (748682178540).
Almost surely, 210131121320131 is an apocalyptic number.
10131121320131 is a deficient number, since it is larger than the sum of its proper divisors (1847793536509).
10131121320131 is an equidigital number, since it uses as much as digits as its factorization.
10131121320131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5143694.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10131121320131 its reverse (13102312113101), we get a palindrome (23233433433232).
The spelling of 10131121320131 in words is "ten trillion, one hundred thirty-one billion, one hundred twenty-one million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •