Base | Representation |
---|---|
bin | 110001110011011011… |
… | …1110001111011111000 |
3 | 101020001201011212200012 |
4 | 1203212313301323320 |
5 | 3223014331102430 |
6 | 121044445201052 |
7 | 10504246035206 |
oct | 1434667617370 |
9 | 336051155605 |
10 | 106952597240 |
11 | 413a3a53335 |
12 | 1888a260188 |
13 | a1160594c8 |
14 | 526859c076 |
15 | 2bae7dd695 |
hex | 18e6df1ef8 |
106952597240 has 32 divisors (see below), whose sum is σ = 242480327760. Its totient is φ = 42454464000.
The previous prime is 106952597237. The next prime is 106952597243. The reversal of 106952597240 is 42795259601.
It is an interprime number because it is at equal distance from previous prime (106952597237) and next prime (106952597243).
It is a super-2 number, since 2×1069525972402 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106952597243) 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, 10200161 + ... + 10210640.
Almost surely, 2106952597240 is an apocalyptic number.
106952597240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106952597240 is an abundant number, since it is smaller than the sum of its proper divisors (135527730520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106952597240 is a wasteful number, since it uses less digits than its factorization.
106952597240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20410943 (or 20410939 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 50.
The spelling of 106952597240 in words is "one hundred six billion, nine hundred fifty-two million, five hundred ninety-seven thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •