Base | Representation |
---|---|
bin | 1001100011010001101000… |
… | …1001001101110011000000 |
3 | 1101011221112220110121020020 |
4 | 2120310122021031303000 |
5 | 2334024321204142034 |
6 | 34200214531213440 |
7 | 2132501162204232 |
oct | 230643211156300 |
9 | 41157486417206 |
10 | 10501633662144 |
11 | 3389799475019 |
12 | 1217353a47280 |
13 | 5b23b8896b91 |
14 | 2843d32ca252 |
15 | 1332891c4249 |
hex | 98d1a24dcc0 |
10501633662144 has 224 divisors, whose sum is σ = 28157240632320. Its totient is φ = 3454016397312.
The previous prime is 10501633662119. The next prime is 10501633662199. The reversal of 10501633662144 is 44126633610501.
It is a happy number.
It is a super-2 number, since 2×105016336621442 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10501633662096 and 10501633662105.
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, 7913815209 + ... + 7913816535.
Almost surely, 210501633662144 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 10501633662144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14078620316160).
10501633662144 is an abundant number, since it is smaller than the sum of its proper divisors (17655606970176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10501633662144 is a wasteful number, since it uses less digits than its factorization.
10501633662144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2695 (or 2685 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 42.
The spelling of 10501633662144 in words is "ten trillion, five hundred one billion, six hundred thirty-three million, six hundred sixty-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •