Base | Representation |
---|---|
bin | 1001011000001011100011… |
… | …1011000011110000010111 |
3 | 1100111201112222202111122122 |
4 | 2112002320323003300113 |
5 | 2322413434121000043 |
6 | 33532452524450155 |
7 | 2112642533621465 |
oct | 226027073036027 |
9 | 40451488674578 |
10 | 10311024000023 |
11 | 331597627073a |
12 | 11a64190a995b |
13 | 59a42cb65766 |
14 | 2790b03cb835 |
15 | 12d330332368 |
hex | 960b8ec3c17 |
10311024000023 has 4 divisors (see below), whose sum is σ = 10347458714088. Its totient is φ = 10274589285960.
The previous prime is 10311024000019. The next prime is 10311024000059. The reversal of 10311024000023 is 32000042011301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10311024000023 - 22 = 10311024000019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10311023999965 and 10311024000010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10311024000523) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18217356608 + ... + 18217357173.
It is an arithmetic number, because the mean of its divisors is an integer number (2586864678522).
Almost surely, 210311024000023 is an apocalyptic number.
10311024000023 is a deficient number, since it is larger than the sum of its proper divisors (36434714065).
10311024000023 is an equidigital number, since it uses as much as digits as its factorization.
10311024000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36434714064.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10311024000023 its reverse (32000042011301), we get a palindrome (42311066011324).
The spelling of 10311024000023 in words is "ten trillion, three hundred eleven billion, twenty-four million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •