Base | Representation |
---|---|
bin | 110001010111000011… |
… | …0000111101100111111 |
3 | 101010121022210201111210 |
4 | 1202232012013230333 |
5 | 3214042003230403 |
6 | 120410141015503 |
7 | 10441531413345 |
oct | 1425606075477 |
9 | 333538721453 |
10 | 106000055103 |
11 | 40a552a4328 |
12 | 18663254593 |
13 | 9cc38c75c7 |
14 | 51b7c85995 |
15 | 2b55d83b03 |
hex | 18ae187b3f |
106000055103 has 8 divisors (see below), whose sum is σ = 149647136688. Its totient is φ = 66509838464.
The previous prime is 106000055089. The next prime is 106000055107. The reversal of 106000055103 is 301550000601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106000055103 - 210 = 106000054079 is a prime.
It is a super-2 number, since 2×1060000551032 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106000055103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106000055107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1039216176 + ... + 1039216277.
It is an arithmetic number, because the mean of its divisors is an integer number (18705892086).
Almost surely, 2106000055103 is an apocalyptic number.
106000055103 is a deficient number, since it is larger than the sum of its proper divisors (43647081585).
106000055103 is a wasteful number, since it uses less digits than its factorization.
106000055103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2078432473.
The product of its (nonzero) digits is 450, while the sum is 21.
Adding to 106000055103 its reverse (301550000601), we get a palindrome (407550055704).
The spelling of 106000055103 in words is "one hundred six billion, fifty-five thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •