Base | Representation |
---|---|
bin | 110001101001100100… |
… | …1001011011111110000 |
3 | 101012012122101012010001 |
4 | 1203103021023133300 |
5 | 3221330113122224 |
6 | 120551543115344 |
7 | 10463116523530 |
oct | 1432311133760 |
9 | 335178335101 |
10 | 106621614064 |
11 | 41244137819 |
12 | 187b7442b54 |
13 | a092601084 |
14 | 52366414c0 |
15 | 2b9070e544 |
hex | 18d324b7f0 |
106621614064 has 40 divisors (see below), whose sum is σ = 236121637248. Its totient is φ = 45688992960.
The previous prime is 106621614061. The next prime is 106621614097. The reversal of 106621614064 is 460416126601.
It is a super-2 number, since 2×1066216140642 (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 (106621614061) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 856899 + ... + 973405.
Almost surely, 2106621614064 is an apocalyptic number.
106621614064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
106621614064 is an abundant number, since it is smaller than the sum of its proper divisors (129500023184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106621614064 is a wasteful number, since it uses less digits than its factorization.
106621614064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124693 (or 124687 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 106621614064 in words is "one hundred six billion, six hundred twenty-one million, six hundred fourteen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •