Base | Representation |
---|---|
bin | 110001011101011101… |
… | …0010100100001000110 |
3 | 101011011022101101120010 |
4 | 1202322322110201012 |
5 | 3220012024100140 |
6 | 120443341251050 |
7 | 10450052106330 |
oct | 1427272244106 |
9 | 334138341503 |
10 | 106215065670 |
11 | 410556a9a0a |
12 | 18703263a86 |
13 | a029308cac |
14 | 51d8654450 |
15 | 2b69ba5880 |
hex | 18bae94846 |
106215065670 has 64 divisors (see below), whose sum is σ = 291661710336. Its totient is φ = 24250316160.
The previous prime is 106215065653. The next prime is 106215065699. The reversal of 106215065670 is 76560512601.
It is a super-2 number, since 2×1062150656702 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 98841 + ... + 471380.
It is an arithmetic number, because the mean of its divisors is an integer number (4557214224).
Almost surely, 2106215065670 is an apocalyptic number.
106215065670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106215065670 is an abundant number, since it is smaller than the sum of its proper divisors (185446644666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106215065670 is a wasteful number, since it uses less digits than its factorization.
106215065670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571125.
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 106215065670 in words is "one hundred six billion, two hundred fifteen million, sixty-five thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •