Base | Representation |
---|---|
bin | 10011000101100111… |
… | …11100010100100101 |
3 | 222110011220000120211 |
4 | 21202303330110211 |
5 | 131441403440211 |
6 | 4412512055421 |
7 | 511643111251 |
oct | 114263742445 |
9 | 28404800524 |
10 | 10247718181 |
11 | 438962a388 |
12 | 1b9bb34571 |
13 | c7411138c |
14 | 6d3007261 |
15 | 3ee9e0e21 |
hex | 262cfc525 |
10247718181 has 2 divisors, whose sum is σ = 10247718182. Its totient is φ = 10247718180.
The previous prime is 10247718109. The next prime is 10247718223. The reversal of 10247718181 is 18181774201.
10247718181 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5753222500 + 4494495681 = 75850^2 + 67041^2 .
It is a cyclic number.
It is not a de Polignac number, because 10247718181 - 27 = 10247718053 is a prime.
It is a super-2 number, since 2×102477181812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10247718281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5123859090 + 5123859091.
It is an arithmetic number, because the mean of its divisors is an integer number (5123859091).
Almost surely, 210247718181 is an apocalyptic number.
It is an amenable number.
10247718181 is a deficient number, since it is larger than the sum of its proper divisors (1).
10247718181 is an equidigital number, since it uses as much as digits as its factorization.
10247718181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25088, while the sum is 40.
The spelling of 10247718181 in words is "ten billion, two hundred forty-seven million, seven hundred eighteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •