Base | Representation |
---|---|
bin | 11000001111011110110101… |
… | …101110110111110101110011 |
3 | 111222111111011120220001111010 |
4 | 120033132311232313311303 |
5 | 102433303130132331201 |
6 | 1014431103411522003 |
7 | 31312553125334055 |
oct | 3017366556676563 |
9 | 458444146801433 |
10 | 106617022152051 |
11 | 30a76030560984 |
12 | bb5b114bb9303 |
13 | 4764c328b1458 |
14 | 1c4841188d8d5 |
15 | c4d547bc5bd6 |
hex | 60f7b5bb7d73 |
106617022152051 has 32 divisors (see below), whose sum is σ = 150426449510400. Its totient is φ = 66982254786720.
The previous prime is 106617022152029. The next prime is 106617022152059. The reversal of 106617022152051 is 150251220716601.
It is not a de Polignac number, because 106617022152051 - 210 = 106617022151027 is a prime.
It is a super-2 number, since 2×1066170221520512 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106617022152059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 357891880 + ... + 358189658.
It is an arithmetic number, because the mean of its divisors is an integer number (4700826547200).
Almost surely, 2106617022152051 is an apocalyptic number.
106617022152051 is a deficient number, since it is larger than the sum of its proper divisors (43809427358349).
106617022152051 is a wasteful number, since it uses less digits than its factorization.
106617022152051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330879.
The product of its (nonzero) digits is 50400, while the sum is 39.
Adding to 106617022152051 its reverse (150251220716601), we get a palindrome (256868242868652).
The spelling of 106617022152051 in words is "one hundred six trillion, six hundred seventeen billion, twenty-two million, one hundred fifty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •