Base | Representation |
---|---|
bin | 110001011101011110… |
… | …0011110110011000110 |
3 | 101011011100110011111220 |
4 | 1202322330132303012 |
5 | 3220012200211240 |
6 | 120443401341210 |
7 | 10450056655542 |
oct | 1427274366306 |
9 | 334140404456 |
10 | 106215632070 |
11 | 41055a56509 |
12 | 18703497806 |
13 | a029476a42 |
14 | 51d8760a22 |
15 | 2b69c685d0 |
hex | 18baf1ecc6 |
106215632070 has 64 divisors (see below), whose sum is σ = 259173072576. Its totient is φ = 27851604480.
The previous prime is 106215632063. The next prime is 106215632111. The reversal of 106215632070 is 70236512601.
It is a super-2 number, since 2×1062156320702 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8479452 + ... + 8491968.
It is an arithmetic number, because the mean of its divisors is an integer number (4049579259).
Almost surely, 2106215632070 is an apocalyptic number.
106215632070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106215632070 is an abundant number, since it is smaller than the sum of its proper divisors (152957440506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106215632070 is a wasteful number, since it uses less digits than its factorization.
106215632070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17225.
The product of its (nonzero) digits is 15120, while the sum is 33.
The spelling of 106215632070 in words is "one hundred six billion, two hundred fifteen million, six hundred thirty-two thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •