Base | Representation |
---|---|
bin | 1001100100100000000111… |
… | …11111001110001010110001 |
3 | 2202111220212120112000012102 |
4 | 10302100003333032022301 |
5 | 10224301443100431103 |
6 | 112432043142510145 |
7 | 4301323536666506 |
oct | 462200377161261 |
9 | 82456776460172 |
10 | 21045406655153 |
11 | 678434144a011 |
12 | 243a8a8135355 |
13 | b9875b7c225a |
14 | 52a862d4b4ad |
15 | 26768cab5e88 |
hex | 132403fce2b1 |
21045406655153 has 2 divisors, whose sum is σ = 21045406655154. Its totient is φ = 21045406655152.
The previous prime is 21045406655089. The next prime is 21045406655167. The reversal of 21045406655153 is 35155660454012.
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., 19447323847744 + 1598082807409 = 4409912^2 + 1264153^2 .
It is a cyclic number.
It is not a de Polignac number, because 21045406655153 - 26 = 21045406655089 is a prime.
It is a super-2 number, since 2×210454066551532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21045406655098 and 21045406655107.
It is not a weakly prime, because it can be changed into another prime (21045406655173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10522703327576 + 10522703327577.
It is an arithmetic number, because the mean of its divisors is an integer number (10522703327577).
Almost surely, 221045406655153 is an apocalyptic number.
It is an amenable number.
21045406655153 is a deficient number, since it is larger than the sum of its proper divisors (1).
21045406655153 is an equidigital number, since it uses as much as digits as its factorization.
21045406655153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160000, while the sum is 47.
The spelling of 21045406655153 in words is "twenty-one trillion, forty-five billion, four hundred six million, six hundred fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •