Base | Representation |
---|---|
bin | 110011010001001111… |
… | …000101100001111001 |
3 | 12021002112021202222121 |
4 | 303101033011201321 |
5 | 1400220300004010 |
6 | 41142320321241 |
7 | 3656122166203 |
oct | 632117054171 |
9 | 167075252877 |
10 | 55050000505 |
11 | 2138a321195 |
12 | a804173221 |
13 | 5264086cc6 |
14 | 29432c9773 |
15 | 1672dc63da |
hex | cd13c5879 |
55050000505 has 4 divisors (see below), whose sum is σ = 66060000612. Its totient is φ = 44040000400.
The previous prime is 55050000503. The next prime is 55050000521. The reversal of 55050000505 is 50500005055.
55050000505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 16428317929 + 38621682576 = 128173^2 + 196524^2 .
It is not a de Polignac number, because 55050000505 - 21 = 55050000503 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 55050000505.
It is not an unprimeable number, because it can be changed into a prime (55050000503) 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, 5505000046 + ... + 5505000055.
It is an arithmetic number, because the mean of its divisors is an integer number (16515000153).
Almost surely, 255050000505 is an apocalyptic number.
It is an amenable number.
55050000505 is a deficient number, since it is larger than the sum of its proper divisors (11010000107).
55050000505 is a wasteful number, since it uses less digits than its factorization.
55050000505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11010000106.
The product of its (nonzero) digits is 3125, while the sum is 25.
The spelling of 55050000505 in words is "fifty-five billion, fifty million, five hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •