Base | Representation |
---|---|
bin | 11000001000101100011101… |
… | …001010101011110000011101 |
3 | 111220211220021020201122212101 |
4 | 120020230131022223300131 |
5 | 102403132420122414243 |
6 | 1013432525404205101 |
7 | 31234061655065224 |
oct | 3010543512536035 |
9 | 456756236648771 |
10 | 106150606060573 |
11 | 30906245864a88 |
12 | baa4847239791 |
13 | 472cc614934c9 |
14 | 1c2da06a75cbb |
15 | c4134a65054d |
hex | 608b1d2abc1d |
106150606060573 has 2 divisors, whose sum is σ = 106150606060574. Its totient is φ = 106150606060572.
The previous prime is 106150606060571. The next prime is 106150606060607. The reversal of 106150606060573 is 375060606051601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58057740310969 + 48092865749604 = 7619563^2 + 6934902^2 .
It is a cyclic number.
It is not a de Polignac number, because 106150606060573 - 21 = 106150606060571 is a prime.
It is a super-2 number, since 2×1061506060605732 (a number of 29 digits) contains 22 as substring.
Together with 106150606060571, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106150606060571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53075303030286 + 53075303030287.
It is an arithmetic number, because the mean of its divisors is an integer number (53075303030287).
Almost surely, 2106150606060573 is an apocalyptic number.
It is an amenable number.
106150606060573 is a deficient number, since it is larger than the sum of its proper divisors (1).
106150606060573 is an equidigital number, since it uses as much as digits as its factorization.
106150606060573 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 680400, while the sum is 46.
The spelling of 106150606060573 in words is "one hundred six trillion, one hundred fifty billion, six hundred six million, sixty thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •