Base | Representation |
---|---|
bin | 1001101101001100… |
… | …11011110111001001 |
3 | 111110011102212100221 |
4 | 10312212123313021 |
5 | 41133004400203 |
6 | 2221030030041 |
7 | 243063606265 |
oct | 46646336711 |
9 | 14404385327 |
10 | 5211012553 |
11 | 223453194a |
12 | 10151a8321 |
13 | 6507a05a6 |
14 | 37610d0a5 |
15 | 207738abd |
hex | 13699bdc9 |
5211012553 has 4 divisors (see below), whose sum is σ = 5284407168. Its totient is φ = 5137617940.
The previous prime is 5211012551. The next prime is 5211012557. The reversal of 5211012553 is 3552101125.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5211012553 - 21 = 5211012551 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5211012551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36697201 + ... + 36697342.
It is an arithmetic number, because the mean of its divisors is an integer number (1321101792).
Almost surely, 25211012553 is an apocalyptic number.
It is an amenable number.
5211012553 is a deficient number, since it is larger than the sum of its proper divisors (73394615).
5211012553 is an equidigital number, since it uses as much as digits as its factorization.
5211012553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73394614.
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 5211012553 is about 72187.3434405229. The cubic root of 5211012553 is about 1733.7003616716.
Adding to 5211012553 its reverse (3552101125), we get a palindrome (8763113678).
The spelling of 5211012553 in words is "five billion, two hundred eleven million, twelve thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •