Base | Representation |
---|---|
bin | 10111001110001110101110… |
… | …01100011010001011101101 |
3 | 20200210220111112220122022110 |
4 | 23213013113030122023231 |
5 | 23143133120443132212 |
6 | 300335340534434233 |
7 | 13520300615414466 |
oct | 1347072714321355 |
9 | 220726445818273 |
10 | 51066476536557 |
11 | 152a9197782899 |
12 | 5889037802979 |
13 | 2265718172b41 |
14 | c878b871bd6d |
15 | 5d85524e2a3c |
hex | 2e71d731a2ed |
51066476536557 has 8 divisors (see below), whose sum is σ = 68089581096160. Its totient is φ = 34043844834000.
The previous prime is 51066476536459. The next prime is 51066476536561. The reversal of 51066476536557 is 75563567466015.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51066476536557 - 211 = 51066476534509 is a prime.
It is a super-2 number, since 2×510664765365572 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51066476536567) 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, 117962194 + ... + 118394307.
It is an arithmetic number, because the mean of its divisors is an integer number (8511197637020).
Almost surely, 251066476536557 is an apocalyptic number.
It is an amenable number.
51066476536557 is a deficient number, since it is larger than the sum of its proper divisors (17023104559603).
51066476536557 is a wasteful number, since it uses less digits than its factorization.
51066476536557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 236428523.
The product of its (nonzero) digits is 476280000, while the sum is 66.
The spelling of 51066476536557 in words is "fifty-one trillion, sixty-six billion, four hundred seventy-six million, five hundred thirty-six thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •