Base | Representation |
---|---|
bin | 1001101101001010110101… |
… | …10000011010001011111001 |
3 | 2210120101120100201012022102 |
4 | 10312211122300122023321 |
5 | 10244141401033232213 |
6 | 113220534312033145 |
7 | 4331665524204044 |
oct | 466453260321371 |
9 | 83511510635272 |
10 | 21343215133433 |
11 | 6889674587636 |
12 | 248855b6927b5 |
13 | bba86c59a53b |
14 | 53b034dbbc5b |
15 | 2702bcb80158 |
hex | 13695ac1a2f9 |
21343215133433 has 2 divisors, whose sum is σ = 21343215133434. Its totient is φ = 21343215133432.
The previous prime is 21343215133381. The next prime is 21343215133469. The reversal of 21343215133433 is 33433151234312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13591963345984 + 7751251787449 = 3686728^2 + 2784107^2 .
It is a cyclic number.
It is not a de Polignac number, because 21343215133433 - 234 = 21326035264249 is a prime.
It is not a weakly prime, because it can be changed into another prime (21343215133133) 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, 10671607566716 + 10671607566717.
It is an arithmetic number, because the mean of its divisors is an integer number (10671607566717).
Almost surely, 221343215133433 is an apocalyptic number.
It is an amenable number.
21343215133433 is a deficient number, since it is larger than the sum of its proper divisors (1).
21343215133433 is an equidigital number, since it uses as much as digits as its factorization.
21343215133433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 233280, while the sum is 38.
Adding to 21343215133433 its reverse (33433151234312), we get a palindrome (54776366367745).
The spelling of 21343215133433 in words is "twenty-one trillion, three hundred forty-three billion, two hundred fifteen million, one hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •