Base | Representation |
---|---|
bin | 1001100001010101011111… |
… | …0110000011011100011111 |
3 | 1101001202112110101211112120 |
4 | 2120111113312003130133 |
5 | 2333003044111304111 |
6 | 34133024054034023 |
7 | 2130211313043414 |
oct | 230252766033437 |
9 | 41052473354476 |
10 | 10468309088031 |
11 | 3376648632283 |
12 | 12109b3648913 |
13 | 5ac2077c7382 |
14 | 28295150a10b |
15 | 132488791406 |
hex | 98557d8371f |
10468309088031 has 4 divisors (see below), whose sum is σ = 13957745450712. Its totient is φ = 6978872725352.
The previous prime is 10468309088011. The next prime is 10468309088051. The reversal of 10468309088031 is 13088090386401.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (10468309088011) and next prime (10468309088051).
It is a cyclic number.
It is not a de Polignac number, because 10468309088031 - 27 = 10468309087903 is a prime.
It is a super-2 number, since 2×104683090880312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10468309088011) 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, 1744718181336 + ... + 1744718181341.
It is an arithmetic number, because the mean of its divisors is an integer number (3489436362678).
Almost surely, 210468309088031 is an apocalyptic number.
10468309088031 is a deficient number, since it is larger than the sum of its proper divisors (3489436362681).
10468309088031 is an equidigital number, since it uses as much as digits as its factorization.
10468309088031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3489436362680.
The product of its (nonzero) digits is 995328, while the sum is 51.
The spelling of 10468309088031 in words is "ten trillion, four hundred sixty-eight billion, three hundred nine million, eighty-eight thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •