Base | Representation |
---|---|
bin | 1001111100110100001001… |
… | …0001101110110101111100 |
3 | 1102201220001211210020101122 |
4 | 2133031002101232311330 |
5 | 2413221411233204414 |
6 | 35133540352330112 |
7 | 2206263103432040 |
oct | 237150221566574 |
9 | 42656054706348 |
10 | 10940393647484 |
11 | 3538881aa9054 |
12 | 12883a3843938 |
13 | 6148a03c2b92 |
14 | 29b7370b2020 |
15 | 13e8b87b2b8e |
hex | 9f34246ed7c |
10940393647484 has 12 divisors (see below), whose sum is σ = 21880787295024. Its totient is φ = 4688740134624.
The previous prime is 10940393647451. The next prime is 10940393647507. The reversal of 10940393647484 is 48474639304901.
10940393647484 is an admirable number.
It is a hoax number, since the sum of its digits (62) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 195364172249 + ... + 195364172304.
It is an arithmetic number, because the mean of its divisors is an integer number (1823398941252).
Almost surely, 210940393647484 is an apocalyptic number.
10940393647484 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10940393647484 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10940393647484 is a wasteful number, since it uses less digits than its factorization.
10940393647484 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 390728344564 (or 390728344562 counting only the distinct ones).
The product of its (nonzero) digits is 62705664, while the sum is 62.
The spelling of 10940393647484 in words is "ten trillion, nine hundred forty billion, three hundred ninety-three million, six hundred forty-seven thousand, four hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •