Base | Representation |
---|---|
bin | 110011010010000110… |
… | …011001100011010011 |
3 | 12021010112120110011001 |
4 | 303102012121203103 |
5 | 1400233003003220 |
6 | 41143555202431 |
7 | 3656356350100 |
oct | 632206314323 |
9 | 167115513131 |
10 | 55064500435 |
11 | 213975251aa |
12 | a808ba6417 |
13 | 5267092b49 |
14 | 29451c1aa7 |
15 | 16742dc80a |
hex | cd21998d3 |
55064500435 has 24 divisors (see below), whose sum is σ = 76882160880. Its totient is φ = 37750353984.
The previous prime is 55064500391. The next prime is 55064500481. The reversal of 55064500435 is 53400546055.
It is not a de Polignac number, because 55064500435 - 29 = 55064499923 is a prime.
It is a super-2 number, since 2×550645004352 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55064500394 and 55064500403.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1247157 + ... + 1290553.
It is an arithmetic number, because the mean of its divisors is an integer number (3203423370).
Almost surely, 255064500435 is an apocalyptic number.
55064500435 is a deficient number, since it is larger than the sum of its proper divisors (21817660445).
55064500435 is a wasteful number, since it uses less digits than its factorization.
55064500435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48595 (or 48588 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 37.
The spelling of 55064500435 in words is "fifty-five billion, sixty-four million, five hundred thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •