Base | Representation |
---|---|
bin | 110001011010000110… |
… | …1001100101110111001 |
3 | 101010212110201020000022 |
4 | 1202310031030232321 |
5 | 3214244224332014 |
6 | 120424242220225 |
7 | 10444214666315 |
oct | 1426415145671 |
9 | 333773636008 |
10 | 106102574009 |
11 | 40aa81562a3 |
12 | 18691654675 |
13 | a00bc10793 |
14 | 51c7730b45 |
15 | 2b5ed84a8e |
hex | 18b434cbb9 |
106102574009 has 2 divisors, whose sum is σ = 106102574010. Its totient is φ = 106102574008.
The previous prime is 106102573957. The next prime is 106102574029. The reversal of 106102574009 is 900475201601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78961000000 + 27141574009 = 281000^2 + 164747^2 .
It is a cyclic number.
It is not a de Polignac number, because 106102574009 - 236 = 37383097273 is a prime.
It is a super-2 number, since 2×1061025740092 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106102574009.
It is not a weakly prime, because it can be changed into another prime (106102574029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53051287004 + 53051287005.
It is an arithmetic number, because the mean of its divisors is an integer number (53051287005).
Almost surely, 2106102574009 is an apocalyptic number.
It is an amenable number.
106102574009 is a deficient number, since it is larger than the sum of its proper divisors (1).
106102574009 is an equidigital number, since it uses as much as digits as its factorization.
106102574009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 35.
The spelling of 106102574009 in words is "one hundred six billion, one hundred two million, five hundred seventy-four thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •