Base | Representation |
---|---|
bin | 110001010111001100… |
… | …1011000101101101001 |
3 | 101010121200022022101000 |
4 | 1202232121120231221 |
5 | 3214044301334023 |
6 | 120410441145213 |
7 | 10441622346516 |
oct | 1425631305551 |
9 | 333550268330 |
10 | 106005105513 |
11 | 40a5813381a |
12 | 18664a8b209 |
13 | 9cc4975308 |
14 | 51b87dc30d |
15 | 2b56530243 |
hex | 18ae658b69 |
106005105513 has 32 divisors (see below), whose sum is σ = 163905511680. Its totient is φ = 67583894400.
The previous prime is 106005105511. The next prime is 106005105533. The reversal of 106005105513 is 315501500601.
106005105513 is a `hidden beast` number, since 1 + 0 + 60 + 0 + 51 + 0 + 551 + 3 = 666.
It is not a de Polignac number, because 106005105513 - 21 = 106005105511 is a prime.
It is a super-2 number, since 2×1060051055132 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106005105511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3744813 + ... + 3773013.
It is an arithmetic number, because the mean of its divisors is an integer number (5122047240).
Almost surely, 2106005105513 is an apocalyptic number.
It is an amenable number.
106005105513 is a deficient number, since it is larger than the sum of its proper divisors (57900406167).
106005105513 is a wasteful number, since it uses less digits than its factorization.
106005105513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34286 (or 34280 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The spelling of 106005105513 in words is "one hundred six billion, five million, one hundred five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •