Base | Representation |
---|---|
bin | 1001101100001101000000… |
… | …10111010110101101010111 |
3 | 2210110012220011021220210102 |
4 | 10312012200113112231113 |
5 | 10243120411421413333 |
6 | 113153404534244315 |
7 | 4326412145536106 |
oct | 466064027265527 |
9 | 83405804256712 |
10 | 21310023232343 |
11 | 687659162201a |
12 | 24820377b669b |
13 | bb76acb41091 |
14 | 5395a6a9603d |
15 | 26e4c8c07ae8 |
hex | 1361a05d6b57 |
21310023232343 has 2 divisors, whose sum is σ = 21310023232344. Its totient is φ = 21310023232342.
The previous prime is 21310023232283. The next prime is 21310023232357. The reversal of 21310023232343 is 34323232001312.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21310023232343 - 28 = 21310023232087 is a prime.
It is a super-2 number, since 2×213100232323432 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21310023232243) 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, 10655011616171 + 10655011616172.
It is an arithmetic number, because the mean of its divisors is an integer number (10655011616172).
Almost surely, 221310023232343 is an apocalyptic number.
21310023232343 is a deficient number, since it is larger than the sum of its proper divisors (1).
21310023232343 is an equidigital number, since it uses as much as digits as its factorization.
21310023232343 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 21310023232343 its reverse (34323232001312), we get a palindrome (55633255233655).
The spelling of 21310023232343 in words is "twenty-one trillion, three hundred ten billion, twenty-three million, two hundred thirty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •