Base | Representation |
---|---|
bin | 11000001111010011000010… |
… | …001101011111000000111011 |
3 | 111222110021110012121101001001 |
4 | 120033103002031133000323 |
5 | 102433101200212222111 |
6 | 1014421205530505431 |
7 | 31311624042046222 |
oct | 3017230215370073 |
9 | 458407405541031 |
10 | 106604346601531 |
11 | 30a7071653a199 |
12 | bb58777b95277 |
13 | 47639927bacbc |
14 | 1c4796c25dcb9 |
15 | c4d054eb21c1 |
hex | 60f4c235f03b |
106604346601531 has 2 divisors, whose sum is σ = 106604346601532. Its totient is φ = 106604346601530.
The previous prime is 106604346601507. The next prime is 106604346601537. The reversal of 106604346601531 is 135106643406601.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106604346601531 is a prime.
It is a super-2 number, since 2×1066043466015312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106604346601537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53302173300765 + 53302173300766.
It is an arithmetic number, because the mean of its divisors is an integer number (53302173300766).
Almost surely, 2106604346601531 is an apocalyptic number.
106604346601531 is a deficient number, since it is larger than the sum of its proper divisors (1).
106604346601531 is an equidigital number, since it uses as much as digits as its factorization.
106604346601531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 933120, while the sum is 46.
The spelling of 106604346601531 in words is "one hundred six trillion, six hundred four billion, three hundred forty-six million, six hundred one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •