Base | Representation |
---|---|
bin | 100111011100001001000… |
… | …1001000101111110011101 |
3 | 201012012101122222012212212 |
4 | 1032320102021011332131 |
5 | 1202302243043214323 |
6 | 15310100121010205 |
7 | 1066423234066055 |
oct | 116702211057635 |
9 | 21165348865785 |
10 | 5420553101213 |
11 | 17aa930a04018 |
12 | 736658323965 |
13 | 304204865153 |
14 | 14a4db48a565 |
15 | 960036dcb78 |
hex | 4ee12245f9d |
5420553101213 has 2 divisors, whose sum is σ = 5420553101214. Its totient is φ = 5420553101212.
The previous prime is 5420553101203. The next prime is 5420553101219. The reversal of 5420553101213 is 3121013550245.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5265129500569 + 155423600644 = 2294587^2 + 394238^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5420553101213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5420553101213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5420553101219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2710276550606 + 2710276550607.
It is an arithmetic number, because the mean of its divisors is an integer number (2710276550607).
Almost surely, 25420553101213 is an apocalyptic number.
It is an amenable number.
5420553101213 is a deficient number, since it is larger than the sum of its proper divisors (1).
5420553101213 is an equidigital number, since it uses as much as digits as its factorization.
5420553101213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 5420553101213 its reverse (3121013550245), we get a palindrome (8541566651458).
The spelling of 5420553101213 in words is "five trillion, four hundred twenty billion, five hundred fifty-three million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •