Base | Representation |
---|---|
bin | 100100110000101000100… |
… | …0111101100111000000101 |
3 | 122212222201110121210010101 |
4 | 1021201101013230320011 |
5 | 1130233443040412123 |
6 | 14424545042524101 |
7 | 1031004164540644 |
oct | 111412107547005 |
9 | 18788643553111 |
10 | 5052242513413 |
11 | 167870a207087 |
12 | 6971a9966631 |
13 | 2a85695cc1b4 |
14 | 13675bc5d35b |
15 | 8b648dceaad |
hex | 498511ece05 |
5052242513413 has 2 divisors, whose sum is σ = 5052242513414. Its totient is φ = 5052242513412.
The previous prime is 5052242513393. The next prime is 5052242513429. The reversal of 5052242513413 is 3143152422505.
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., 3233674290564 + 1818568222849 = 1798242^2 + 1348543^2 .
It is a cyclic number.
It is not a de Polignac number, because 5052242513413 - 221 = 5052240416261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5052242513443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526121256706 + 2526121256707.
It is an arithmetic number, because the mean of its divisors is an integer number (2526121256707).
Almost surely, 25052242513413 is an apocalyptic number.
It is an amenable number.
5052242513413 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052242513413 is an equidigital number, since it uses as much as digits as its factorization.
5052242513413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 5052242513413 its reverse (3143152422505), we get a palindrome (8195394935918).
It can be divided in two parts, 5052242 and 513413, that added together give a palindrome (5565655).
The spelling of 5052242513413 in words is "five trillion, fifty-two billion, two hundred forty-two million, five hundred thirteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •