Base | Representation |
---|---|
bin | 1010010101110110… |
… | …01110100000101011 |
3 | 112022221002012002201 |
4 | 11022323032200223 |
5 | 42332303212321 |
6 | 2314530441031 |
7 | 254404165642 |
oct | 51273164053 |
9 | 15287065081 |
10 | 5552007211 |
11 | 2399a66213 |
12 | 10ab433177 |
13 | 6a632288a |
14 | 3a9514359 |
15 | 227644291 |
hex | 14aece82b |
5552007211 has 4 divisors (see below), whose sum is σ = 5670135072. Its totient is φ = 5433879352.
The previous prime is 5552007173. The next prime is 5552007257. The reversal of 5552007211 is 1127002555.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5552007211 - 223 = 5543618603 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5552007211.
It is not an unprimeable number, because it can be changed into a prime (5552007011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59063860 + ... + 59063953.
It is an arithmetic number, because the mean of its divisors is an integer number (1417533768).
Almost surely, 25552007211 is an apocalyptic number.
5552007211 is a deficient number, since it is larger than the sum of its proper divisors (118127861).
5552007211 is a wasteful number, since it uses less digits than its factorization.
5552007211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118127860.
The product of its (nonzero) digits is 3500, while the sum is 28.
The square root of 5552007211 is about 74511.7924291182. The cubic root of 5552007211 is about 1770.7204671230.
Adding to 5552007211 its reverse (1127002555), we get a palindrome (6679009766).
The spelling of 5552007211 in words is "five billion, five hundred fifty-two million, seven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •