Base | Representation |
---|---|
bin | 11110001111100011100000… |
… | …111101000011010001100101 |
3 | 122102221122212222200002210012 |
4 | 132033203200331003101211 |
5 | 114413220114224314414 |
6 | 1150520033103140005 |
7 | 40005451520566556 |
oct | 3617434075032145 |
9 | 572848788602705 |
10 | 133010321323109 |
11 | 394213a68a67aa |
12 | 12b0235b5a4605 |
13 | 592aa86527a69 |
14 | 24bba3bb7c32d |
15 | 1059d84ebc33e |
hex | 78f8e0f43465 |
133010321323109 has 2 divisors, whose sum is σ = 133010321323110. Its totient is φ = 133010321323108.
The previous prime is 133010321323097. The next prime is 133010321323141. The reversal of 133010321323109 is 901323123010331.
It is an a-pointer prime, because the next prime (133010321323141) can be obtained adding 133010321323109 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70149050503009 + 62861270820100 = 8375503^2 + 7928510^2 .
It is a cyclic number.
It is not a de Polignac number, because 133010321323109 - 24 = 133010321323093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133010321323409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66505160661554 + 66505160661555.
It is an arithmetic number, because the mean of its divisors is an integer number (66505160661555).
Almost surely, 2133010321323109 is an apocalyptic number.
It is an amenable number.
133010321323109 is a deficient number, since it is larger than the sum of its proper divisors (1).
133010321323109 is an equidigital number, since it uses as much as digits as its factorization.
133010321323109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 32.
The spelling of 133010321323109 in words is "one hundred thirty-three trillion, ten billion, three hundred twenty-one million, three hundred twenty-three thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •