Base | Representation |
---|---|
bin | 11000000110100100110110… |
… | …101010111100100000101010 |
3 | 111220022222110001202110221122 |
4 | 120012210312222330200222 |
5 | 102343241222243411023 |
6 | 1013242005501335242 |
7 | 31220415563024462 |
oct | 3006446652744052 |
9 | 456288401673848 |
10 | 106005005060138 |
11 | 3085a5198a2368 |
12 | ba80591867522 |
13 | 471c2c93b6892 |
14 | 1c2695361cba2 |
15 | c3c677d5d2c8 |
hex | 606936abc82a |
106005005060138 has 8 divisors (see below), whose sum is σ = 159007562977188. Its totient is φ = 53002484067744.
The previous prime is 106005005060137. The next prime is 106005005060159. The reversal of 106005005060138 is 831060500500601.
It can be written as a sum of positive squares in 2 ways, for example, as 105191135850529 + 813869209609 = 10256273^2 + 902147^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1060050050601382 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106005005060098 and 106005005060107.
It is not an unprimeable number, because it can be changed into a prime (106005005060137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 342131 + ... + 14564582.
Almost surely, 2106005005060138 is an apocalyptic number.
106005005060138 is a deficient number, since it is larger than the sum of its proper divisors (53002557917050).
106005005060138 is a wasteful number, since it uses less digits than its factorization.
106005005060138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18462328.
The product of its (nonzero) digits is 21600, while the sum is 35.
Adding to 106005005060138 its reverse (831060500500601), we get a palindrome (937065505560739).
The spelling of 106005005060138 in words is "one hundred six trillion, five billion, five million, sixty thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •