Base | Representation |
---|---|
bin | 110100000011101100… |
… | …100001111001010101 |
3 | 12100021112021110021110 |
4 | 310003230201321111 |
5 | 1403434011022134 |
6 | 41402321405233 |
7 | 4016112042060 |
oct | 640354417125 |
9 | 170245243243 |
10 | 55896579669 |
11 | 21784186697 |
12 | a9bb799819 |
13 | 536a598218 |
14 | 29c38db8d7 |
15 | 16c239e7e9 |
hex | d03b21e55 |
55896579669 has 8 divisors (see below), whose sum is σ = 85175740480. Its totient is φ = 31940902656.
The previous prime is 55896579637. The next prime is 55896579671. The reversal of 55896579669 is 96697569855.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55896579669 - 25 = 55896579637 is a prime.
It is a super-2 number, since 2×558965796692 (a number of 22 digits) contains 22 as substring.
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 55896579669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55896578669) 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 in 7 ways as a sum of consecutive naturals, for example, 1330870924 + ... + 1330870965.
It is an arithmetic number, because the mean of its divisors is an integer number (10646967560).
Almost surely, 255896579669 is an apocalyptic number.
It is an amenable number.
55896579669 is a deficient number, since it is larger than the sum of its proper divisors (29279160811).
55896579669 is a wasteful number, since it uses less digits than its factorization.
55896579669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2661741899.
The product of its digits is 1102248000, while the sum is 75.
The spelling of 55896579669 in words is "fifty-five billion, eight hundred ninety-six million, five hundred seventy-nine thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •