Base | Representation |
---|---|
bin | 10011101111101011… |
… | …110101100100101001 |
3 | 2000201112122020212112 |
4 | 103233223311210221 |
5 | 321404441143213 |
6 | 13423433252105 |
7 | 1350245336111 |
oct | 235753654451 |
9 | 60645566775 |
10 | 21201115433 |
11 | 8a9a527903 |
12 | 4138264035 |
13 | 1ccb49ca24 |
14 | 1051a26041 |
15 | 841426ea8 |
hex | 4efaf5929 |
21201115433 has 2 divisors, whose sum is σ = 21201115434. Its totient is φ = 21201115432.
The previous prime is 21201115399. The next prime is 21201115451. The reversal of 21201115433 is 33451110212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14676837904 + 6524277529 = 121148^2 + 80773^2 .
It is a cyclic number.
It is not a de Polignac number, because 21201115433 - 216 = 21201049897 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21201115399 and 21201115408.
It is not a weakly prime, because it can be changed into another prime (21201115493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600557716 + 10600557717.
It is an arithmetic number, because the mean of its divisors is an integer number (10600557717).
Almost surely, 221201115433 is an apocalyptic number.
It is an amenable number.
21201115433 is a deficient number, since it is larger than the sum of its proper divisors (1).
21201115433 is an equidigital number, since it uses as much as digits as its factorization.
21201115433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 21201115433 its reverse (33451110212), we get a palindrome (54652225645).
The spelling of 21201115433 in words is "twenty-one billion, two hundred one million, one hundred fifteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •