Base | Representation |
---|---|
bin | 110001110001010010… |
… | …1101100010101101000 |
3 | 101012212200222111110212 |
4 | 1203202211230111220 |
5 | 3222342432344411 |
6 | 121033401200252 |
7 | 10502414233652 |
oct | 1434245542550 |
9 | 335780874425 |
10 | 106880746856 |
11 | 41367439054 |
12 | 1886a190088 |
13 | a1041c06a0 |
14 | 525cc176d2 |
15 | 2ba834968b |
hex | 18e296c568 |
106880746856 has 32 divisors (see below), whose sum is σ = 216371773800. Its totient is φ = 49202745600.
The previous prime is 106880746823. The next prime is 106880746859. The reversal of 106880746856 is 658647088601.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 55154522500 + 51726224356 = 234850^2 + 227434^2 .
It is a super-2 number, since 2×1068807468562 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106880746795 and 106880746804.
It is not an unprimeable number, because it can be changed into a prime (106880746859) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1280495 + ... + 1361406.
Almost surely, 2106880746856 is an apocalyptic number.
It is an amenable number.
106880746856 is an abundant number, since it is smaller than the sum of its proper divisors (109491026944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106880746856 is a wasteful number, since it uses less digits than its factorization.
106880746856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2642309 (or 2642305 counting only the distinct ones).
The product of its (nonzero) digits is 15482880, while the sum is 59.
The spelling of 106880746856 in words is "one hundred six billion, eight hundred eighty million, seven hundred forty-six thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •