Base | Representation |
---|---|
bin | 11000000110101010000100… |
… | …111010000011010010110011 |
3 | 111220100111220212100112112222 |
4 | 120012222010322003102303 |
5 | 102343334213312011402 |
6 | 1013244334134511255 |
7 | 31221004543305143 |
oct | 3006520472032263 |
9 | 456314825315488 |
10 | 106010612610227 |
11 | 30861937144786 |
12 | ba8169780552b |
13 | 471c9b1085760 |
14 | 1c26d26270923 |
15 | c3c8a52c47a2 |
hex | 606a84e834b3 |
106010612610227 has 8 divisors (see below), whose sum is σ = 114253027077840. Its totient is φ = 97780734136800.
The previous prime is 106010612610139. The next prime is 106010612610241. The reversal of 106010612610227 is 722016216010601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106010612610227 - 210 = 106010612609203 is a prime.
It is a super-2 number, since 2×1060106126102272 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106010612610277) 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, 3133980977 + ... + 3134014802.
It is an arithmetic number, because the mean of its divisors is an integer number (14281628384730).
Almost surely, 2106010612610227 is an apocalyptic number.
106010612610227 is a deficient number, since it is larger than the sum of its proper divisors (8242414467613).
106010612610227 is a wasteful number, since it uses less digits than its factorization.
106010612610227 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6267997093.
The product of its (nonzero) digits is 12096, while the sum is 35.
Adding to 106010612610227 its reverse (722016216010601), we get a palindrome (828026828620828).
The spelling of 106010612610227 in words is "one hundred six trillion, ten billion, six hundred twelve million, six hundred ten thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.458 sec. • engine limits •