Base | Representation |
---|---|
bin | 10011111101111100… |
… | …00000001011011101 |
3 | 1000200002210101120202 |
4 | 21332332000023131 |
5 | 133423322224334 |
6 | 4531425153245 |
7 | 526440331535 |
oct | 117676001335 |
9 | 30602711522 |
10 | 10720117469 |
11 | 4601254a16 |
12 | 20b218b825 |
13 | 101ac51599 |
14 | 739a564c5 |
15 | 42b20617e |
hex | 27ef802dd |
10720117469 has 2 divisors, whose sum is σ = 10720117470. Its totient is φ = 10720117468.
The previous prime is 10720117307. The next prime is 10720117501. The reversal of 10720117469 is 96471102701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10720117444 + 25 = 103538^2 + 5^2 .
It is an emirp because it is prime and its reverse (96471102701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10720117469 - 216 = 10720051933 is a prime.
It is a super-2 number, since 2×107201174692 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10720117069) 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, 5360058734 + 5360058735.
It is an arithmetic number, because the mean of its divisors is an integer number (5360058735).
Almost surely, 210720117469 is an apocalyptic number.
It is an amenable number.
10720117469 is a deficient number, since it is larger than the sum of its proper divisors (1).
10720117469 is an equidigital number, since it uses as much as digits as its factorization.
10720117469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21168, while the sum is 38.
The spelling of 10720117469 in words is "ten billion, seven hundred twenty million, one hundred seventeen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •