Base | Representation |
---|---|
bin | 110001101011111100… |
… | …0011111110110010110 |
3 | 101012102011222212102220 |
4 | 1203113320133312112 |
5 | 3222010442031222 |
6 | 121003503243210 |
7 | 10465103421045 |
oct | 1432770376626 |
9 | 335364885386 |
10 | 106701127062 |
11 | 41285006042 |
12 | 18819ba9506 |
13 | a0a5c2089a |
14 | 524301c55c |
15 | 2b976b8b5c |
hex | 18d7e1fd96 |
106701127062 has 64 divisors (see below), whose sum is σ = 233684766720. Its totient is φ = 32347800576.
The previous prime is 106701127021. The next prime is 106701127087. The reversal of 106701127062 is 260721107601.
It is a super-2 number, since 2×1067011270622 (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 (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 237858 + ... + 519594.
It is an arithmetic number, because the mean of its divisors is an integer number (3651324480).
Almost surely, 2106701127062 is an apocalyptic number.
106701127062 is an abundant number, since it is smaller than the sum of its proper divisors (126983639658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106701127062 is a wasteful number, since it uses less digits than its factorization.
106701127062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281885.
The product of its (nonzero) digits is 7056, while the sum is 33.
The spelling of 106701127062 in words is "one hundred six billion, seven hundred one million, one hundred twenty-seven thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •