Base | Representation |
---|---|
bin | 1001111111101010000011… |
… | …1001110010110100000000 |
3 | 1102220120010001012001101010 |
4 | 2133322200321302310000 |
5 | 2420021413304114224 |
6 | 35212214120040520 |
7 | 2212642155331542 |
oct | 237724071626400 |
9 | 42816101161333 |
10 | 10989225848064 |
11 | 3557560559112 |
12 | 1295951603140 |
13 | 619383233c19 |
14 | 29dc4a695692 |
15 | 140cc587ce29 |
hex | 9fea0e72d00 |
10989225848064 has 144 divisors (see below), whose sum is σ = 29569689781632. Its totient is φ = 3622798516224.
The previous prime is 10989225848023. The next prime is 10989225848129. The reversal of 10989225848064 is 46084852298901.
It is a junction number, because it is equal to n+sod(n) for n = 10989225847986 and 10989225848004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61057534 + ... + 61237250.
It is an arithmetic number, because the mean of its divisors is an integer number (205345067928).
Almost surely, 210989225848064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10989225848064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14784844890816).
10989225848064 is an abundant number, since it is smaller than the sum of its proper divisors (18580463933568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10989225848064 is a wasteful number, since it uses less digits than its factorization.
10989225848064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180612 (or 180598 counting only the distinct ones).
The product of its (nonzero) digits is 79626240, while the sum is 66.
The spelling of 10989225848064 in words is "ten trillion, nine hundred eighty-nine billion, two hundred twenty-five million, eight hundred forty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •