Base | Representation |
---|---|
bin | 110001011000101110… |
… | …1100001111100010000 |
3 | 101010202021001121122020 |
4 | 1202301131201330100 |
5 | 3214200432223121 |
6 | 120415515211440 |
7 | 10443115401345 |
oct | 1426135417420 |
9 | 333667047566 |
10 | 106056523536 |
11 | 40a84162957 |
12 | 1867a146b80 |
13 | a002508c92 |
14 | 51c15847cc |
15 | 2b5acda1c6 |
hex | 18b1761f10 |
106056523536 has 40 divisors (see below), whose sum is σ = 281384204544. Its totient is φ = 34396709760.
The previous prime is 106056523483. The next prime is 106056523553. The reversal of 106056523536 is 635325650601.
It is a super-2 number, since 2×1060565235362 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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, 29856480 + ... + 29860031.
Almost surely, 2106056523536 is an apocalyptic number.
106056523536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106056523536 is an abundant number, since it is smaller than the sum of its proper divisors (175327681008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106056523536 is a wasteful number, since it uses less digits than its factorization.
106056523536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59716559 (or 59716553 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 42.
The spelling of 106056523536 in words is "one hundred six billion, fifty-six million, five hundred twenty-three thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •