Base | Representation |
---|---|
bin | 1001101000011011001110… |
… | …0000001110101001011000 |
3 | 1101111101220200200201222221 |
4 | 2122012303200032221120 |
5 | 2342002014111024104 |
6 | 34305005535353424 |
7 | 2142052461243640 |
oct | 232066340165130 |
9 | 41441820621887 |
10 | 10590105954904 |
11 | 3413269801043 |
12 | 1230525082874 |
13 | 5ba848045678 |
14 | 2887c7351520 |
15 | 135716381c54 |
hex | 9a1b380ea58 |
10590105954904 has 32 divisors (see below), whose sum is σ = 24027971496480. Its totient is φ = 4271639376384.
The previous prime is 10590105954881. The next prime is 10590105954917. The reversal of 10590105954904 is 40945950109501.
It is a super-2 number, since 2×105901059549042 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 5562029487 + ... + 5562031390.
It is an arithmetic number, because the mean of its divisors is an integer number (750874109265).
Almost surely, 210590105954904 is an apocalyptic number.
10590105954904 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10590105954904 is an abundant number, since it is smaller than the sum of its proper divisors (13437865541576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10590105954904 is a wasteful number, since it uses less digits than its factorization.
10590105954904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11124060907 (or 11124060903 counting only the distinct ones).
The product of its (nonzero) digits is 1458000, while the sum is 52.
The spelling of 10590105954904 in words is "ten trillion, five hundred ninety billion, one hundred five million, nine hundred fifty-four thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •