Base | Representation |
---|---|
bin | 11000001110001101111010… |
… | …010110011011000101100111 |
3 | 111222012011212200110122122011 |
4 | 120032031322112123011213 |
5 | 102430342144343304114 |
6 | 1014323133045215051 |
7 | 31303355562665446 |
oct | 3016157226330547 |
9 | 458164780418564 |
10 | 106530126541159 |
11 | 30a4219a21a322 |
12 | bb46303a01487 |
13 | 4759994c92c09 |
14 | 1c4412adacd5d |
15 | c4b15e15d1c4 |
hex | 60e37a59b167 |
106530126541159 has 2 divisors, whose sum is σ = 106530126541160. Its totient is φ = 106530126541158.
The previous prime is 106530126541133. The next prime is 106530126541171. The reversal of 106530126541159 is 951145621035601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106530126541159 - 219 = 106530126016871 is a prime.
It is a super-2 number, since 2×1065301265411592 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106530126545159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53265063270579 + 53265063270580.
It is an arithmetic number, because the mean of its divisors is an integer number (53265063270580).
Almost surely, 2106530126541159 is an apocalyptic number.
106530126541159 is a deficient number, since it is larger than the sum of its proper divisors (1).
106530126541159 is an equidigital number, since it uses as much as digits as its factorization.
106530126541159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972000, while the sum is 49.
The spelling of 106530126541159 in words is "one hundred six trillion, five hundred thirty billion, one hundred twenty-six million, five hundred forty-one thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •