Base | Representation |
---|---|
bin | 1001101100001101101110… |
… | …11011001001100011100101 |
3 | 2210110020220010020222120202 |
4 | 10312012313123021203211 |
5 | 10243122204441244023 |
6 | 113153511154240245 |
7 | 4326424554065663 |
oct | 466066733114345 |
9 | 83406803228522 |
10 | 21310410103013 |
11 | 687676aa3a749 |
12 | 2482125286085 |
13 | bb7742036635 |
14 | 5396021ddc33 |
15 | 26e4ecb76128 |
hex | 1361b76c98e5 |
21310410103013 has 2 divisors, whose sum is σ = 21310410103014. Its totient is φ = 21310410103012.
The previous prime is 21310410102991. The next prime is 21310410103019. The reversal of 21310410103013 is 31030101401312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16753901481409 + 4556508621604 = 4093153^2 + 2134598^2 .
It is a cyclic number.
It is not a de Polignac number, because 21310410103013 - 210 = 21310410101989 is a prime.
It is a super-3 number, since 3×213104101030133 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21310410103019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10655205051506 + 10655205051507.
It is an arithmetic number, because the mean of its divisors is an integer number (10655205051507).
Almost surely, 221310410103013 is an apocalyptic number.
It is an amenable number.
21310410103013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21310410103013 is an equidigital number, since it uses as much as digits as its factorization.
21310410103013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 21310410103013 its reverse (31030101401312), we get a palindrome (52340511504325).
The spelling of 21310410103013 in words is "twenty-one trillion, three hundred ten billion, four hundred ten million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •