Base | Representation |
---|---|
bin | 1001001011000000011110… |
… | …0100010000101011100111 |
3 | 1022201002101210100002120202 |
4 | 2102300013210100223213 |
5 | 2310211441300011111 |
6 | 33240504001421115 |
7 | 2060411342656166 |
oct | 222600744205347 |
9 | 38632353302522 |
10 | 10084710157031 |
11 | 32389a0a80864 |
12 | 116a59903a79b |
13 | 581ca40692b3 |
14 | 26c16167b3dd |
15 | 1274d6bb3b3b |
hex | 92c07910ae7 |
10084710157031 has 8 divisors (see below), whose sum is σ = 10208250304560. Its totient is φ = 9961397316288.
The previous prime is 10084710157019. The next prime is 10084710157033. The reversal of 10084710157031 is 13075101748001.
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 10084710157031 - 230 = 10083636415207 is a prime.
It is a super-2 number, since 2×100847101570312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10084710157033) 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 7 ways as a sum of consecutive naturals, for example, 56737421 + ... + 56914886.
It is an arithmetic number, because the mean of its divisors is an integer number (1276031288070).
Almost surely, 210084710157031 is an apocalyptic number.
10084710157031 is a deficient number, since it is larger than the sum of its proper divisors (123540147529).
10084710157031 is an equidigital number, since it uses as much as digits as its factorization.
10084710157031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113653393.
The product of its (nonzero) digits is 23520, while the sum is 38.
The spelling of 10084710157031 in words is "ten trillion, eighty-four billion, seven hundred ten million, one hundred fifty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •