Base | Representation |
---|---|
bin | 10011101110001111… |
… | …111001101101011101 |
3 | 2000122212021211110211 |
4 | 103232033321231131 |
5 | 321332303441013 |
6 | 13421212532421 |
7 | 1346533441621 |
oct | 235617715535 |
9 | 60585254424 |
10 | 21177015133 |
11 | 8a879669aa |
12 | 4130181111 |
13 | 1cc64b21b1 |
14 | 104c751181 |
15 | 83e26623d |
hex | 4ee3f9b5d |
21177015133 has 2 divisors, whose sum is σ = 21177015134. Its totient is φ = 21177015132.
The previous prime is 21177015127. The next prime is 21177015191. The reversal of 21177015133 is 33151077112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19231587684 + 1945427449 = 138678^2 + 44107^2 .
It is a cyclic number.
It is not a de Polignac number, because 21177015133 - 229 = 20640144221 is a prime.
It is a super-2 number, since 2×211770151332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21177015095 and 21177015104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21177013133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10588507566 + 10588507567.
It is an arithmetic number, because the mean of its divisors is an integer number (10588507567).
Almost surely, 221177015133 is an apocalyptic number.
It is an amenable number.
21177015133 is a deficient number, since it is larger than the sum of its proper divisors (1).
21177015133 is an equidigital number, since it uses as much as digits as its factorization.
21177015133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4410, while the sum is 31.
The spelling of 21177015133 in words is "twenty-one billion, one hundred seventy-seven million, fifteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •