Base | Representation |
---|---|
bin | 110001101001001010… |
… | …1101110110001101001 |
3 | 101012011200222222110011 |
4 | 1203102111232301221 |
5 | 3221313140031311 |
6 | 120550342051521 |
7 | 10462564062061 |
oct | 1432225566151 |
9 | 335150888404 |
10 | 106608127081 |
11 | 41237565855 |
12 | 187b2a19ba1 |
13 | a08c88b301 |
14 | 52349303a1 |
15 | 2b8e448321 |
hex | 18d256ec69 |
106608127081 has 9 divisors (see below), whose sum is σ = 108940327549. Its totient is φ = 104324849644.
The previous prime is 106608127079. The next prime is 106608127097. The reversal of 106608127081 is 180721806601.
The square root of 106608127081 is 326509.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 106608127081 - 21 = 106608127079 is a prime.
It is a super-3 number, since 3×1066081270813 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106608127181) 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 8 ways as a sum of consecutive naturals, for example, 15342450 + ... + 15349396.
Almost surely, 2106608127081 is an apocalyptic number.
106608127081 is the 326509-th square number.
106608127081 is the 163255-th centered octagonal number.
It is an amenable number.
106608127081 is a deficient number, since it is larger than the sum of its proper divisors (2332200468).
106608127081 is an frugal number, since it uses more digits than its factorization.
106608127081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13988 (or 6994 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 40.
The spelling of 106608127081 in words is "one hundred six billion, six hundred eight million, one hundred twenty-seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •