Base | Representation |
---|---|
bin | 1010000010000110011011… |
… | …0101011100001100001011 |
3 | 1110001120110101102000012202 |
4 | 2200201212311130030023 |
5 | 2421213400013120014 |
6 | 35243355223430415 |
7 | 2215656310650236 |
oct | 240414665341413 |
9 | 43046411360182 |
10 | 11031201301259 |
11 | 35733406083a7 |
12 | 12a1b06bb540b |
13 | 6203126479a9 |
14 | 2a1cad36c41d |
15 | 141e309c93de |
hex | a0866d5c30b |
11031201301259 has 2 divisors, whose sum is σ = 11031201301260. Its totient is φ = 11031201301258.
The previous prime is 11031201301229. The next prime is 11031201301271. The reversal of 11031201301259 is 95210310213011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11031201301259 - 240 = 9931689673483 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11031201301229) 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, 5515600650629 + 5515600650630.
It is an arithmetic number, because the mean of its divisors is an integer number (5515600650630).
Almost surely, 211031201301259 is an apocalyptic number.
11031201301259 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031201301259 is an equidigital number, since it uses as much as digits as its factorization.
11031201301259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 29.
The spelling of 11031201301259 in words is "eleven trillion, thirty-one billion, two hundred one million, three hundred one thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •