Base | Representation |
---|---|
bin | 1001110111010011010000… |
… | …01011101010011000100001 |
3 | 2211210200010021101111222102 |
4 | 10323221220023222120201 |
5 | 10320342322134414244 |
6 | 114044505524220145 |
7 | 4366101306031562 |
oct | 473515013523041 |
9 | 84720107344872 |
10 | 21691332732449 |
11 | 6a03273921196 |
12 | 2523b1353a655 |
13 | c1463a187913 |
14 | 54dc1a848169 |
15 | 27939480054e |
hex | 13ba682ea621 |
21691332732449 has 2 divisors, whose sum is σ = 21691332732450. Its totient is φ = 21691332732448.
The previous prime is 21691332732347. The next prime is 21691332732451. The reversal of 21691332732449 is 94423723319612.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19734313598224 + 1957019134225 = 4442332^2 + 1398935^2 .
It is a cyclic number.
It is not a de Polignac number, because 21691332732449 - 220 = 21691331683873 is a prime.
Together with 21691332732451, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 21691332732394 and 21691332732403.
It is not a weakly prime, because it can be changed into another prime (21691332732149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10845666366224 + 10845666366225.
It is an arithmetic number, because the mean of its divisors is an integer number (10845666366225).
Almost surely, 221691332732449 is an apocalyptic number.
It is an amenable number.
21691332732449 is a deficient number, since it is larger than the sum of its proper divisors (1).
21691332732449 is an equidigital number, since it uses as much as digits as its factorization.
21691332732449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11757312, while the sum is 56.
The spelling of 21691332732449 in words is "twenty-one trillion, six hundred ninety-one billion, three hundred thirty-two million, seven hundred thirty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •