Base | Representation |
---|---|
bin | 110001010111000000… |
… | …0111111000001010000 |
3 | 101010121020021022202022 |
4 | 1202232000333001100 |
5 | 3214041132140231 |
6 | 120410052111012 |
7 | 10441514105330 |
oct | 1425600770120 |
9 | 333536238668 |
10 | 105998708816 |
11 | 40a545648a0 |
12 | 18662905468 |
13 | 9cc35458a0 |
14 | 51b7a150c0 |
15 | 2b55bb9c7b |
hex | 18ae03f050 |
105998708816 has 160 divisors (see below), whose sum is σ = 283199040768. Its totient is φ = 37090897920.
The previous prime is 105998708813. The next prime is 105998708843. The reversal of 105998708816 is 618807899501.
It is a super-2 number, since 2×1059987088162 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105998708813) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 503156 + ... + 682028.
Almost surely, 2105998708816 is an apocalyptic number.
105998708816 is a gapful number since it is divisible by the number (16) 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 105998708816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141599520384).
105998708816 is an abundant number, since it is smaller than the sum of its proper divisors (177200331952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105998708816 is a wasteful number, since it uses less digits than its factorization.
105998708816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178949 (or 178943 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 62.
The spelling of 105998708816 in words is "one hundred five billion, nine hundred ninety-eight million, seven hundred eight thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •