Base | Representation |
---|---|
bin | 1100001001010101001011… |
… | …0001011101011001100101 |
3 | 1202021200011000200202011111 |
4 | 3002111102301131121211 |
5 | 3222244344124123303 |
6 | 44222540155105021 |
7 | 2545553344146532 |
oct | 302252261353145 |
9 | 52250130622144 |
10 | 13354442020453 |
11 | 4289650409826 |
12 | 15b821b742171 |
13 | 75b41a9100c1 |
14 | 3425037cdd89 |
15 | 1825a6674b6d |
hex | c2552c5d665 |
13354442020453 has 2 divisors, whose sum is σ = 13354442020454. Its totient is φ = 13354442020452.
The previous prime is 13354442020421. The next prime is 13354442020477. The reversal of 13354442020453 is 35402024445331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11612841848644 + 1741600171809 = 3407762^2 + 1319697^2 .
It is a cyclic number.
It is not a de Polignac number, because 13354442020453 - 25 = 13354442020421 is a prime.
It is a super-2 number, since 2×133544420204532 (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 (13354442080453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6677221010226 + 6677221010227.
It is an arithmetic number, because the mean of its divisors is an integer number (6677221010227).
Almost surely, 213354442020453 is an apocalyptic number.
It is an amenable number.
13354442020453 is a deficient number, since it is larger than the sum of its proper divisors (1).
13354442020453 is an equidigital number, since it uses as much as digits as its factorization.
13354442020453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 691200, while the sum is 40.
Adding to 13354442020453 its reverse (35402024445331), we get a palindrome (48756466465784).
The spelling of 13354442020453 in words is "thirteen trillion, three hundred fifty-four billion, four hundred forty-two million, twenty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •