Base | Representation |
---|---|
bin | 110001010110011111… |
… | …0101001000111110000 |
3 | 101010120000112202111210 |
4 | 1202230332221013300 |
5 | 3214022204130431 |
6 | 120404231240120 |
7 | 10441213223166 |
oct | 1425476510760 |
9 | 333500482453 |
10 | 105981317616 |
11 | 40a457665a9 |
12 | 18658b19040 |
13 | 9cbca66a35 |
14 | 51b55a9236 |
15 | 2b543d1d46 |
hex | 18acfa91f0 |
105981317616 has 40 divisors (see below), whose sum is σ = 273801721600. Its totient is φ = 35324957376.
The previous prime is 105981317581. The next prime is 105981317627. The reversal of 105981317616 is 616713189501.
It is a super-2 number, since 2×1059813176162 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
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, 863235 + ... + 978333.
It is an arithmetic number, because the mean of its divisors is an integer number (6845043040).
Almost surely, 2105981317616 is an apocalyptic number.
105981317616 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
105981317616 is an abundant number, since it is smaller than the sum of its proper divisors (167820403984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105981317616 is a wasteful number, since it uses less digits than its factorization.
105981317616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134293 (or 134287 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 48.
The spelling of 105981317616 in words is "one hundred five billion, nine hundred eighty-one million, three hundred seventeen thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •