Base | Representation |
---|---|
bin | 1001010011011110111000… |
… | …0011110100010101111101 |
3 | 1100020000012222012212101222 |
4 | 2110313232003310111331 |
5 | 2320103134121010023 |
6 | 33431423503243125 |
7 | 2104054434441401 |
oct | 224675603642575 |
9 | 40200188185358 |
10 | 10230311110013 |
11 | 3294717a10865 |
12 | 11928525a94a5 |
13 | 59293912a447 |
14 | 275214ac1101 |
15 | 12b1a9496cc8 |
hex | 94dee0f457d |
10230311110013 has 8 divisors (see below), whose sum is σ = 10278938182656. Its totient is φ = 10181735092800.
The previous prime is 10230311110001. The next prime is 10230311110031. The reversal of 10230311110013 is 31001111303201.
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 10230311110013 - 216 = 10230311044477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10230311109973 and 10230311110000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230311310013) 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, 12362123 + ... + 13163688.
It is an arithmetic number, because the mean of its divisors is an integer number (1284867272832).
Almost surely, 210230311110013 is an apocalyptic number.
It is an amenable number.
10230311110013 is a deficient number, since it is larger than the sum of its proper divisors (48627072643).
10230311110013 is a wasteful number, since it uses less digits than its factorization.
10230311110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25527715.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10230311110013 its reverse (31001111303201), we get a palindrome (41231422413214).
The spelling of 10230311110013 in words is "ten trillion, two hundred thirty billion, three hundred eleven million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •