Base | Representation |
---|---|
bin | 10011100101101010… |
… | …100100011101001001 |
3 | 2000021211022122222001 |
4 | 103211222210131021 |
5 | 321033422323032 |
6 | 13355030231001 |
7 | 1343134433554 |
oct | 234552443511 |
9 | 60254278861 |
10 | 21033011017 |
11 | 8a1364a537 |
12 | 40abab5461 |
13 | 1ca2702465 |
14 | 103758769b |
15 | 8317bd3e7 |
hex | 4e5aa4749 |
21033011017 has 2 divisors, whose sum is σ = 21033011018. Its totient is φ = 21033011016.
The previous prime is 21033010987. The next prime is 21033011071. The reversal of 21033011017 is 71011033012.
Together with next prime (21033011071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11642625801 + 9390385216 = 107901^2 + 96904^2 .
It is a cyclic number.
It is not a de Polignac number, because 21033011017 - 231 = 18885527369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21033010985 and 21033011003.
It is not a weakly prime, because it can be changed into another prime (21033011317) 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, 10516505508 + 10516505509.
It is an arithmetic number, because the mean of its divisors is an integer number (10516505509).
Almost surely, 221033011017 is an apocalyptic number.
It is an amenable number.
21033011017 is a deficient number, since it is larger than the sum of its proper divisors (1).
21033011017 is an equidigital number, since it uses as much as digits as its factorization.
21033011017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 19.
Adding to 21033011017 its reverse (71011033012), we get a palindrome (92044044029).
The spelling of 21033011017 in words is "twenty-one billion, thirty-three million, eleven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •