Base | Representation |
---|---|
bin | 11010001100100010111000… |
… | …110011101011001101111001 |
3 | 120002221002111211002211101211 |
4 | 122030202320303223031321 |
5 | 110100110222121131014 |
6 | 1045011201515243121 |
7 | 33160512332643205 |
oct | 3214427063531571 |
9 | 502832454084354 |
10 | 115211303302009 |
11 | 33789926185a62 |
12 | 10b088804494a1 |
13 | 4c394c1394c75 |
14 | 2064384a6bb05 |
15 | d4bd9c8a9cc4 |
hex | 68c8b8ceb379 |
115211303302009 has 2 divisors, whose sum is σ = 115211303302010. Its totient is φ = 115211303302008.
The previous prime is 115211303301979. The next prime is 115211303302021. The reversal of 115211303302009 is 900203303112511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101034722869609 + 14176580432400 = 10051603^2 + 3765180^2 .
It is a cyclic number.
It is not a de Polignac number, because 115211303302009 - 215 = 115211303269241 is a prime.
It is not a weakly prime, because it can be changed into another prime (115211303302309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57605651651004 + 57605651651005.
It is an arithmetic number, because the mean of its divisors is an integer number (57605651651005).
Almost surely, 2115211303302009 is an apocalyptic number.
It is an amenable number.
115211303302009 is a deficient number, since it is larger than the sum of its proper divisors (1).
115211303302009 is an equidigital number, since it uses as much as digits as its factorization.
115211303302009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 31.
The spelling of 115211303302009 in words is "one hundred fifteen trillion, two hundred eleven billion, three hundred three million, three hundred two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •