Base | Representation |
---|---|
bin | 10010101010100000… |
… | …10110110100011111 |
3 | 221212022221020220121 |
4 | 21111100112310133 |
5 | 131010143120402 |
6 | 4334145255411 |
7 | 503212011004 |
oct | 112520266437 |
9 | 27768836817 |
10 | 10020285727 |
11 | 428220aa81 |
12 | 1b37934567 |
13 | c38c7096a |
14 | 6b0b238ab |
15 | 3d9a68837 |
hex | 255416d1f |
10020285727 has 2 divisors, whose sum is σ = 10020285728. Its totient is φ = 10020285726.
The previous prime is 10020285617. The next prime is 10020285757. The reversal of 10020285727 is 72758202001.
10020285727 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10020285727 - 231 = 7872802079 is a prime.
It is a super-2 number, since 2×100202857272 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10020285692 and 10020285701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10020285757) 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, 5010142863 + 5010142864.
It is an arithmetic number, because the mean of its divisors is an integer number (5010142864).
Almost surely, 210020285727 is an apocalyptic number.
10020285727 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020285727 is an equidigital number, since it uses as much as digits as its factorization.
10020285727 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15680, while the sum is 34.
Adding to 10020285727 its reverse (72758202001), we get a palindrome (82778487728).
The spelling of 10020285727 in words is "ten billion, twenty million, two hundred eighty-five thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •