Base | Representation |
---|---|
bin | 110001010111001100… |
… | …1000001110110011100 |
3 | 101010121200010112220200 |
4 | 1202232121001312130 |
5 | 3214044240334433 |
6 | 120410435143500 |
7 | 10441621506510 |
oct | 1425631016634 |
9 | 333550115820 |
10 | 106005011868 |
11 | 40a5807a428 |
12 | 18664a44b90 |
13 | 9cc49417c2 |
14 | 51b87b6140 |
15 | 2b56512613 |
hex | 18ae641d9c |
106005011868 has 72 divisors (see below), whose sum is σ = 306574998912. Its totient is φ = 30253688352.
The previous prime is 106005011867. The next prime is 106005011881. The reversal of 106005011868 is 868110500601.
106005011868 is a `hidden beast` number, since 10 + 60 + 0 + 501 + 1 + 86 + 8 = 666.
It is a super-2 number, since 2×1060050118682 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106005011867) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3330 + ... + 460457.
It is an arithmetic number, because the mean of its divisors is an integer number (4257986096).
Almost surely, 2106005011868 is an apocalyptic number.
106005011868 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
106005011868 is an abundant number, since it is smaller than the sum of its proper divisors (200569987044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106005011868 is a wasteful number, since it uses less digits than its factorization.
106005011868 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464711 (or 464706 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 36.
The spelling of 106005011868 in words is "one hundred six billion, five million, eleven thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •