Base | Representation |
---|---|
bin | 1001100100100110110111… |
… | …01110010110011111001001 |
3 | 2202112021012211011102210201 |
4 | 10302103123232112133021 |
5 | 10224331401141031213 |
6 | 112433442240212201 |
7 | 4301512326604255 |
oct | 462233356263711 |
9 | 82467184142721 |
10 | 21049026111433 |
11 | 67859295470a1 |
12 | 243b53830a061 |
13 | b98bb7625168 |
14 | 52aac7923265 |
15 | 26780071c6dd |
hex | 1324dbb967c9 |
21049026111433 has 2 divisors, whose sum is σ = 21049026111434. Its totient is φ = 21049026111432.
The previous prime is 21049026111391. The next prime is 21049026111437. The reversal of 21049026111433 is 33411162094012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13626817868304 + 7422208243129 = 3691452^2 + 2724373^2 .
It is a cyclic number.
It is not a de Polignac number, because 21049026111433 - 29 = 21049026110921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21049026111392 and 21049026111401.
It is not a weakly prime, because it can be changed into another prime (21049026111437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10524513055716 + 10524513055717.
It is an arithmetic number, because the mean of its divisors is an integer number (10524513055717).
Almost surely, 221049026111433 is an apocalyptic number.
It is an amenable number.
21049026111433 is a deficient number, since it is larger than the sum of its proper divisors (1).
21049026111433 is an equidigital number, since it uses as much as digits as its factorization.
21049026111433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 21049026111433 in words is "twenty-one trillion, forty-nine billion, twenty-six million, one hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •