Base | Representation |
---|---|
bin | 10101000100010000… |
… | …10001010100110101 |
3 | 1002012012210010100021 |
4 | 22202020101110311 |
5 | 141130330333301 |
6 | 5110140445141 |
7 | 550162341022 |
oct | 124210212465 |
9 | 32165703307 |
10 | 11310011701 |
11 | 488423020a |
12 | 22378497b1 |
13 | 10b321c421 |
14 | 79412c549 |
15 | 462dc98a1 |
hex | 2a2211535 |
11310011701 has 2 divisors, whose sum is σ = 11310011702. Its totient is φ = 11310011700.
The previous prime is 11310011689. The next prime is 11310011737. The reversal of 11310011701 is 10711001311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10834728100 + 475283601 = 104090^2 + 21801^2 .
It is a cyclic number.
It is not a de Polignac number, because 11310011701 - 29 = 11310011189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11310015701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655005850 + 5655005851.
It is an arithmetic number, because the mean of its divisors is an integer number (5655005851).
Almost surely, 211310011701 is an apocalyptic number.
It is an amenable number.
11310011701 is a deficient number, since it is larger than the sum of its proper divisors (1).
11310011701 is an equidigital number, since it uses as much as digits as its factorization.
11310011701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 16.
The spelling of 11310011701 in words is "eleven billion, three hundred ten million, eleven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •