Base | Representation |
---|---|
bin | 1001000110101010100111… |
… | …0001100001011001001111 |
3 | 1022102221212121210210012222 |
4 | 2101222221301201121033 |
5 | 2303001212231143043 |
6 | 33142330413245555 |
7 | 2052131105134340 |
oct | 221525161413117 |
9 | 38387777723188 |
10 | 10010122131023 |
11 | 320a2a5a85963 |
12 | 11580417938bb |
13 | 577c48237871 |
14 | 2686c75a40c7 |
15 | 1255bd8c7d68 |
hex | 91aa9c6164f |
10010122131023 has 8 divisors (see below), whose sum is σ = 11749332540192. Its totient is φ = 8348209962336.
The previous prime is 10010122131001. The next prime is 10010122131059. The reversal of 10010122131023 is 32013122101001.
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 10010122131023 - 220 = 10010121082447 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10010122130992 and 10010122131010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010122130023) 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, 19324559840 + ... + 19324560357.
It is an arithmetic number, because the mean of its divisors is an integer number (1468666567524).
Almost surely, 210010122131023 is an apocalyptic number.
10010122131023 is a deficient number, since it is larger than the sum of its proper divisors (1739210409169).
10010122131023 is an equidigital number, since it uses as much as digits as its factorization.
10010122131023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38649120241.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10010122131023 its reverse (32013122101001), we get a palindrome (42023244232024).
The spelling of 10010122131023 in words is "ten trillion, ten billion, one hundred twenty-two million, one hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •