Base | Representation |
---|---|
bin | 110001011000110101… |
… | …1001100100101000111 |
3 | 101010202111210121221010 |
4 | 1202301223030211013 |
5 | 3214202341343210 |
6 | 120420124053303 |
7 | 10443161012121 |
oct | 1426153144507 |
9 | 333674717833 |
10 | 106060106055 |
11 | 40a8618a512 |
12 | 1867b394233 |
13 | a003191807 |
14 | 51c1c38211 |
15 | 2b5b296920 |
hex | 18b1acc947 |
106060106055 has 64 divisors (see below), whose sum is σ = 183665018880. Its totient is φ = 52086758400.
The previous prime is 106060106051. The next prime is 106060106059. The reversal of 106060106055 is 550601060601.
It is an interprime number because it is at equal distance from previous prime (106060106051) and next prime (106060106059).
It is not a de Polignac number, because 106060106055 - 22 = 106060106051 is a prime.
It is a super-2 number, since 2×1060601060552 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106060106051) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3149889 + ... + 3183381.
It is an arithmetic number, because the mean of its divisors is an integer number (2869765920).
Almost surely, 2106060106055 is an apocalyptic number.
106060106055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106060106055 is a deficient number, since it is larger than the sum of its proper divisors (77604912825).
106060106055 is a wasteful number, since it uses less digits than its factorization.
106060106055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33832.
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 106060106055 its reverse (550601060601), we get a palindrome (656661166656).
The spelling of 106060106055 in words is "one hundred six billion, sixty million, one hundred six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •