Base | Representation |
---|---|
bin | 110011011010001111… |
… | …100100111101110101 |
3 | 12021111001122122201222 |
4 | 303122033210331311 |
5 | 1401022441433323 |
6 | 41205315400125 |
7 | 3662635546124 |
oct | 633217447565 |
9 | 167431578658 |
10 | 55201124213 |
11 | 21457660714 |
12 | a8468b3045 |
13 | 528948a511 |
14 | 29593c7abb |
15 | 16812c89c8 |
hex | cda3e4f75 |
55201124213 has 4 divisors (see below), whose sum is σ = 58106446560. Its totient is φ = 52295801868.
The previous prime is 55201124191. The next prime is 55201124227. The reversal of 55201124213 is 31242110255.
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 55201124213 - 26 = 55201124149 is a prime.
It is a super-2 number, since 2×552011242132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55201174213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1452661145 + ... + 1452661182.
It is an arithmetic number, because the mean of its divisors is an integer number (14526611640).
Almost surely, 255201124213 is an apocalyptic number.
It is an amenable number.
55201124213 is a deficient number, since it is larger than the sum of its proper divisors (2905322347).
55201124213 is a wasteful number, since it uses less digits than its factorization.
55201124213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2905322346.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 55201124213 its reverse (31242110255), we get a palindrome (86443234468).
The spelling of 55201124213 in words is "fifty-five billion, two hundred one million, one hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •