Base | Representation |
---|---|
bin | 110001101100010110… |
… | …1110010011100110000 |
3 | 101012110011021121102120 |
4 | 1203120231302130300 |
5 | 3222023031100010 |
6 | 121005122514240 |
7 | 10465333233300 |
oct | 1433055623460 |
9 | 335404247376 |
10 | 106715096880 |
11 | 41291987847 |
12 | 18822805980 |
13 | a0a8aa2352 |
14 | 5244c17600 |
15 | 2b98a27e70 |
hex | 18d8b72730 |
106715096880 has 960 divisors, whose sum is σ = 428547428352. Its totient is φ = 21799895040.
The previous prime is 106715096867. The next prime is 106715096899. The reversal of 106715096880 is 88690517601.
It is a super-3 number, since 3×1067150968803 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 415233712 + ... + 415233968.
Almost surely, 2106715096880 is an apocalyptic number.
106715096880 is a gapful number since it is divisible by the number (10) 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 106715096880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214273714176).
106715096880 is an abundant number, since it is smaller than the sum of its proper divisors (321832331472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106715096880 is a wasteful number, since it uses less digits than its factorization.
106715096880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 402 (or 389 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 51.
The spelling of 106715096880 in words is "one hundred six billion, seven hundred fifteen million, ninety-six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •