Base | Representation |
---|---|
bin | 110001101011111011… |
… | …1010011101011101001 |
3 | 101012102011102000111001 |
4 | 1203113313103223221 |
5 | 3222010402040311 |
6 | 121003452435001 |
7 | 10465100651350 |
oct | 1432767235351 |
9 | 335364360431 |
10 | 106700815081 |
11 | 41284912703 |
12 | 18819a78a61 |
13 | a0a5b41893 |
14 | 5242d7a997 |
15 | 2b976564c1 |
hex | 18d7dd3ae9 |
106700815081 has 16 divisors (see below), whose sum is σ = 125939283840. Its totient is φ = 88488840960.
The previous prime is 106700815063. The next prime is 106700815139. The reversal of 106700815081 is 180518007601.
It is a cyclic number.
It is not a de Polignac number, because 106700815081 - 27 = 106700814953 is a prime.
It is a super-2 number, since 2×1067008150812 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106700815081.
It is not an unprimeable number, because it can be changed into a prime (106700815031) 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 15 ways as a sum of consecutive naturals, for example, 1104400 + ... + 1197121.
It is an arithmetic number, because the mean of its divisors is an integer number (7871205240).
Almost surely, 2106700815081 is an apocalyptic number.
It is an amenable number.
106700815081 is a deficient number, since it is larger than the sum of its proper divisors (19238468759).
106700815081 is a wasteful number, since it uses less digits than its factorization.
106700815081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2301744.
The product of its (nonzero) digits is 13440, while the sum is 37.
The spelling of 106700815081 in words is "one hundred six billion, seven hundred million, eight hundred fifteen thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •