Base | Representation |
---|---|
bin | 110011001110010000… |
… | …010110101000011101 |
3 | 12020222001012112122001 |
4 | 303032100112220131 |
5 | 1400120000013203 |
6 | 41133332522301 |
7 | 3654644203204 |
oct | 631620265035 |
9 | 166861175561 |
10 | 55000001053 |
11 | 21364080928 |
12 | a7ab480391 |
13 | 52568cbc2a |
14 | 293a7d223b |
15 | 166d7eb91d |
hex | cce416a1d |
55000001053 has 2 divisors, whose sum is σ = 55000001054. Its totient is φ = 55000001052.
The previous prime is 55000001051. The next prime is 55000001059. The reversal of 55000001053 is 35010000055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 41921334009 + 13078667044 = 204747^2 + 114362^2 .
It is a cyclic number.
It is not a de Polignac number, because 55000001053 - 21 = 55000001051 is a prime.
It is a super-2 number, since 2×550000010532 (a number of 22 digits) contains 22 as substring.
Together with 55000001051, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 55000001053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55000001051) 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 as a sum of consecutive naturals, namely, 27500000526 + 27500000527.
It is an arithmetic number, because the mean of its divisors is an integer number (27500000527).
Almost surely, 255000001053 is an apocalyptic number.
It is an amenable number.
55000001053 is a deficient number, since it is larger than the sum of its proper divisors (1).
55000001053 is an equidigital number, since it uses as much as digits as its factorization.
55000001053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 375, while the sum is 19.
The spelling of 55000001053 in words is "fifty-five billion, one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •