Base | Representation |
---|---|
bin | 1001101110010001100011… |
… | …0100111001000000000000 |
3 | 1101212000021121101010000000 |
4 | 2123210120310321000000 |
5 | 2400123312032233023 |
6 | 34423104520000000 |
7 | 2152240534446222 |
oct | 233443064710000 |
9 | 41760247333000 |
10 | 10690590117888 |
11 | 3451943466a3a |
12 | 1247aa9000000 |
13 | 5c716cc53885 |
14 | 28d5da804412 |
15 | 138147d57243 |
hex | 9b918d39000 |
10690590117888 has 416 divisors, whose sum is σ = 32318870917120. Its totient is φ = 3535094513664.
The previous prime is 10690590117869. The next prime is 10690590117913. The reversal of 10690590117888 is 88871109509601.
It is a super-2 number, since 2×106905901178882 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1137655206 + ... + 1137664602.
Almost surely, 210690590117888 is an apocalyptic number.
10690590117888 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10690590117888, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16159435458560).
10690590117888 is an abundant number, since it is smaller than the sum of its proper divisors (21628280799232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10690590117888 is an frugal number, since it uses more digits than its factorization.
10690590117888 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9569 (or 9529 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 63.
The spelling of 10690590117888 in words is "ten trillion, six hundred ninety billion, five hundred ninety million, one hundred seventeen thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •