Base | Representation |
---|---|
bin | 1001100010110101101101… |
… | …0000101011111010110101 |
3 | 1101011020012101200022111121 |
4 | 2120231123100223322311 |
5 | 2333413442332024411 |
6 | 34152534542503541 |
7 | 2132114322651442 |
oct | 230553320537265 |
9 | 41136171608447 |
10 | 10494136204981 |
11 | 33865a1340530 |
12 | 1215a00b94bb1 |
13 | 5b17924b93b0 |
14 | 283cc167a9c9 |
15 | 132e9ad95571 |
hex | 98b5b42beb5 |
10494136204981 has 32 divisors (see below), whose sum is σ = 13025265523200. Its totient is φ = 8321697108480.
The previous prime is 10494136204957. The next prime is 10494136204987. The reversal of 10494136204981 is 18940263149401.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10494136204981 - 29 = 10494136204469 is a prime.
It is a super-2 number, since 2×104941362049812 (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 (10494136204987) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26725696 + ... + 27115513.
It is an arithmetic number, because the mean of its divisors is an integer number (407039547600).
Almost surely, 210494136204981 is an apocalyptic number.
10494136204981 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10494136204981 is a deficient number, since it is larger than the sum of its proper divisors (2531129318219).
10494136204981 is a wasteful number, since it uses less digits than its factorization.
10494136204981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53841309.
The product of its (nonzero) digits is 1492992, while the sum is 52.
The spelling of 10494136204981 in words is "ten trillion, four hundred ninety-four billion, one hundred thirty-six million, two hundred four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •