Base | Representation |
---|---|
bin | 1001110000111001011110… |
… | …10000101010110001100001 |
3 | 2211000122021012201212021012 |
4 | 10320130233100222301201 |
5 | 10303241243102130421 |
6 | 113355443404510305 |
7 | 4344152453122502 |
oct | 470345720526141 |
9 | 84018235655235 |
10 | 21471334411361 |
11 | 6928a3a5783aa |
12 | 24a935654b395 |
13 | bc997992b073 |
14 | 54330a79aba9 |
15 | 2737ba84295b |
hex | 13872f42ac61 |
21471334411361 has 2 divisors, whose sum is σ = 21471334411362. Its totient is φ = 21471334411360.
The previous prime is 21471334411357. The next prime is 21471334411451. The reversal of 21471334411361 is 16311443317412.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17488655619136 + 3982678792225 = 4181944^2 + 1995665^2 .
It is a cyclic number.
It is not a de Polignac number, because 21471334411361 - 22 = 21471334411357 is a prime.
It is a super-2 number, since 2×214713344113612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21471334411321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10735667205680 + 10735667205681.
It is an arithmetic number, because the mean of its divisors is an integer number (10735667205681).
Almost surely, 221471334411361 is an apocalyptic number.
It is an amenable number.
21471334411361 is a deficient number, since it is larger than the sum of its proper divisors (1).
21471334411361 is an equidigital number, since it uses as much as digits as its factorization.
21471334411361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 145152, while the sum is 41.
Adding to 21471334411361 its reverse (16311443317412), we get a palindrome (37782777728773).
The spelling of 21471334411361 in words is "twenty-one trillion, four hundred seventy-one billion, three hundred thirty-four million, four hundred eleven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •