Base | Representation |
---|---|
bin | 110011100110011101… |
… | …111010000111110001 |
3 | 12022000100112222002021 |
4 | 303212131322013301 |
5 | 1401432442114343 |
6 | 41241523151441 |
7 | 4001005664401 |
oct | 634635720761 |
9 | 168010488067 |
10 | 55406207473 |
11 | 215523a5811 |
12 | a8a3515581 |
13 | 52bcb04466 |
14 | 2978730801 |
15 | 16942d90ed |
hex | ce677a1f1 |
55406207473 has 8 divisors (see below), whose sum is σ = 57085900200. Its totient is φ = 53750007168.
The previous prime is 55406207453. The next prime is 55406207503. The reversal of 55406207473 is 37470260455.
It can be written as a sum of positive squares in 4 ways, for example, as 5656243264 + 49749964209 = 75208^2 + 223047^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55406207473 is a prime.
It is a super-2 number, since 2×554062074732 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55406207453) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5868318 + ... + 5877751.
It is an arithmetic number, because the mean of its divisors is an integer number (7135737525).
Almost surely, 255406207473 is an apocalyptic number.
55406207473 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
55406207473 is a deficient number, since it is larger than the sum of its proper divisors (1679692727).
55406207473 is a wasteful number, since it uses less digits than its factorization.
55406207473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11746211.
The product of its (nonzero) digits is 705600, while the sum is 43.
The spelling of 55406207473 in words is "fifty-five billion, four hundred six million, two hundred seven thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •