Base | Representation |
---|---|
bin | 110001101100010100… |
… | …0100011011011000000 |
3 | 101012110001200220000200 |
4 | 1203120220203123000 |
5 | 3222022203141413 |
6 | 121005033245200 |
7 | 10465315456431 |
oct | 1433050433300 |
9 | 335401626020 |
10 | 106713724608 |
11 | 4129112a837 |
12 | 18822263800 |
13 | a0a871185a |
14 | 524497b488 |
15 | 2b98856573 |
hex | 18d8a236c0 |
106713724608 has 168 divisors, whose sum is σ = 308490274560. Its totient is φ = 35268134400.
The previous prime is 106713724591. The next prime is 106713724633. The reversal of 106713724608 is 806427317601.
106713724608 is a `hidden beast` number, since 1 + 0 + 6 + 7 + 1 + 37 + 2 + 4 + 608 = 666.
It is a super-2 number, since 2×1067137246082 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 68449333 + ... + 68450891.
Almost surely, 2106713724608 is an apocalyptic number.
106713724608 is a gapful number since it is divisible by the number (18) 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 106713724608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154245137280).
106713724608 is an abundant number, since it is smaller than the sum of its proper divisors (201776549952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106713724608 is a wasteful number, since it uses less digits than its factorization.
106713724608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2515 (or 2502 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 45.
The spelling of 106713724608 in words is "one hundred six billion, seven hundred thirteen million, seven hundred twenty-four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •