Base | Representation |
---|---|
bin | 110001101111000111… |
… | …0101101101111111000 |
3 | 101012200121100222200110 |
4 | 1203132032231233320 |
5 | 3222220222130311 |
6 | 121022225504320 |
7 | 10500535512654 |
oct | 1433616555770 |
9 | 335617328613 |
10 | 106807614456 |
11 | 4132a128654 |
12 | 188497a20a0 |
13 | a0c1cc618a |
14 | 525321ba64 |
15 | 2ba1c008a6 |
hex | 18de3adbf8 |
106807614456 has 32 divisors (see below), whose sum is σ = 268940044800. Its totient is φ = 35346403680.
The previous prime is 106807614449. The next prime is 106807614457. The reversal of 106807614456 is 654416708601.
It is a happy number.
It is a super-2 number, since 2×1068076144562 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106807614457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16005000 + ... + 16011671.
It is an arithmetic number, because the mean of its divisors is an integer number (8404376400).
Almost surely, 2106807614456 is an apocalyptic number.
It is an amenable number.
106807614456 is an abundant number, since it is smaller than the sum of its proper divisors (162132430344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106807614456 is a wasteful number, since it uses less digits than its factorization.
106807614456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32016819 (or 32016815 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 48.
The spelling of 106807614456 in words is "one hundred six billion, eight hundred seven million, six hundred fourteen thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •