Base | Representation |
---|---|
bin | 1001001101101001010110… |
… | …0100110000000111001001 |
3 | 1022212102102001210202020120 |
4 | 2103122111210300013021 |
5 | 2311432311313322101 |
6 | 33313402135213453 |
7 | 2063604615014430 |
oct | 223322544600711 |
9 | 38772361722216 |
10 | 10130042323401 |
11 | 3256143890370 |
12 | 117732a817289 |
13 | 586349a2b290 |
14 | 270422094117 |
15 | 12878b866b36 |
hex | 936959301c9 |
10130042323401 has 128 divisors (see below), whose sum is σ = 19220031516672. Its totient is φ = 4567449600000.
The previous prime is 10130042323393. The next prime is 10130042323403. The reversal of 10130042323401 is 10432324003101.
It is a happy number.
It is not a de Polignac number, because 10130042323401 - 23 = 10130042323393 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10130042323403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 53560201 + ... + 53749001.
It is an arithmetic number, because the mean of its divisors is an integer number (150156496224).
Almost surely, 210130042323401 is an apocalyptic number.
10130042323401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10130042323401 is a deficient number, since it is larger than the sum of its proper divisors (9089989193271).
10130042323401 is a wasteful number, since it uses less digits than its factorization.
10130042323401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189903.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10130042323401 its reverse (10432324003101), we get a palindrome (20562366326502).
The spelling of 10130042323401 in words is "ten trillion, one hundred thirty billion, forty-two million, three hundred twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •