Base | Representation |
---|---|
bin | 110011100001010101… |
… | …100011001010100011 |
3 | 12021210100120210021112 |
4 | 303201111203022203 |
5 | 1401243423131321 |
6 | 41225210213535 |
7 | 3665612230313 |
oct | 634125431243 |
9 | 167710523245 |
10 | 55320130211 |
11 | 21508853685 |
12 | a87a7242ab |
13 | 52a8026b78 |
14 | 296b125443 |
15 | 168b984a5b |
hex | ce15632a3 |
55320130211 has 4 divisors (see below), whose sum is σ = 55320765672. Its totient is φ = 55319494752.
The previous prime is 55320130189. The next prime is 55320130223. The reversal of 55320130211 is 11203102355.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 11203102355 = 5 ⋅2240620471.
It is a cyclic number.
It is not a de Polignac number, because 55320130211 - 218 = 55319868067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55320130231) 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, 161561 + ... + 369786.
It is an arithmetic number, because the mean of its divisors is an integer number (13830191418).
Almost surely, 255320130211 is an apocalyptic number.
55320130211 is a deficient number, since it is larger than the sum of its proper divisors (635461).
55320130211 is a wasteful number, since it uses less digits than its factorization.
55320130211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635460.
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 55320130211 its reverse (11203102355), we get a palindrome (66523232566).
The spelling of 55320130211 in words is "fifty-five billion, three hundred twenty million, one hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •