Base | Representation |
---|---|
bin | 110001101001001101… |
… | …1101110001101010100 |
3 | 101012011210221202211021 |
4 | 1203102123232031110 |
5 | 3221314040310440 |
6 | 120550435450524 |
7 | 10462613322646 |
oct | 1432233561524 |
9 | 335153852737 |
10 | 106609697620 |
11 | 41238438818 |
12 | 187b3456a44 |
13 | a08ccbb11a |
14 | 5234c1c896 |
15 | 2b8e65884a |
hex | 18d26ee354 |
106609697620 has 48 divisors (see below), whose sum is σ = 225399968640. Its totient is φ = 42354658944.
The previous prime is 106609697573. The next prime is 106609697647. The reversal of 106609697620 is 26796906601.
It is a super-2 number, since 2×1066096976202 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9662547 + ... + 9673573.
It is an arithmetic number, because the mean of its divisors is an integer number (4695832680).
Almost surely, 2106609697620 is an apocalyptic number.
106609697620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106609697620 is an abundant number, since it is smaller than the sum of its proper divisors (118790271020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106609697620 is a wasteful number, since it uses less digits than its factorization.
106609697620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14272 (or 14270 counting only the distinct ones).
The product of its (nonzero) digits is 1469664, while the sum is 52.
The spelling of 106609697620 in words is "one hundred six billion, six hundred nine million, six hundred ninety-seven thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •