Base | Representation |
---|---|
bin | 110001010111001100… |
… | …1001101101000001001 |
3 | 101010121200020000002020 |
4 | 1202232121031220021 |
5 | 3214044243410410 |
6 | 120410440155053 |
7 | 10441622100240 |
oct | 1425631155011 |
9 | 333550200066 |
10 | 106005060105 |
11 | 40a5810269a |
12 | 18664a68a89 |
13 | 9cc495a749 |
14 | 51b87c9957 |
15 | 2b56521a70 |
hex | 18ae64da09 |
106005060105 has 16 divisors (see below), whose sum is σ = 193837824384. Its totient is φ = 48459456000.
The previous prime is 106005060097. The next prime is 106005060163. The reversal of 106005060105 is 501060500601.
It is not a de Polignac number, because 106005060105 - 23 = 106005060097 is a prime.
It is a super-2 number, since 2×1060050601052 (a number of 23 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 504785896 + ... + 504786105.
It is an arithmetic number, because the mean of its divisors is an integer number (12114864024).
Almost surely, 2106005060105 is an apocalyptic number.
106005060105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106005060105 is a deficient number, since it is larger than the sum of its proper divisors (87832764279).
106005060105 is a wasteful number, since it uses less digits than its factorization.
106005060105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009572016.
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 106005060105 its reverse (501060500601), we get a palindrome (607065560706).
It can be divided in two parts, 10600 and 5060105, that added together give a palindrome (5070705).
The spelling of 106005060105 in words is "one hundred six billion, five million, sixty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •