Base | Representation |
---|---|
bin | 1001100100011010100111… |
… | …10100100000001110001101 |
3 | 2202111122020121000222200122 |
4 | 10302031103310200032031 |
5 | 10224224414432234001 |
6 | 112430434002034325 |
7 | 4301160360550061 |
oct | 462152364401615 |
9 | 82448217028618 |
10 | 21042451055501 |
11 | 6783065055277 |
12 | 243a2023489a5 |
13 | b983aa385415 |
14 | 52a6625c1aa1 |
15 | 267568392b1b |
hex | 132353d2038d |
21042451055501 has 2 divisors, whose sum is σ = 21042451055502. Its totient is φ = 21042451055500.
The previous prime is 21042451055389. The next prime is 21042451055513. The reversal of 21042451055501 is 10555015424012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21007509726025 + 34941329476 = 4583395^2 + 186926^2 .
It is a cyclic number.
It is not a de Polignac number, because 21042451055501 - 214 = 21042451039117 is a prime.
It is a super-2 number, since 2×210424510555012 (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 (21042451055201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10521225527750 + 10521225527751.
It is an arithmetic number, because the mean of its divisors is an integer number (10521225527751).
Almost surely, 221042451055501 is an apocalyptic number.
It is an amenable number.
21042451055501 is a deficient number, since it is larger than the sum of its proper divisors (1).
21042451055501 is an equidigital number, since it uses as much as digits as its factorization.
21042451055501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40000, while the sum is 35.
Adding to 21042451055501 its reverse (10555015424012), we get a palindrome (31597466479513).
The spelling of 21042451055501 in words is "twenty-one trillion, forty-two billion, four hundred fifty-one million, fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •