Base | Representation |
---|---|
bin | 10111100000000000101100… |
… | …11010001110000100110000 |
3 | 20202222022110102111010010002 |
4 | 23300000112122032010300 |
5 | 23233140330123240431 |
6 | 301524140302325132 |
7 | 13612366463264225 |
oct | 1360002632160460 |
9 | 222868412433102 |
10 | 51677422477616 |
11 | 155142a9840971 |
12 | 59675202897a8 |
13 | 22ab21077ac40 |
14 | ca92b45dd94c |
15 | 5e93ad2c23cb |
hex | 2f001668e130 |
51677422477616 has 40 divisors (see below), whose sum is σ = 107873148749520. Its totient is φ = 23840894474496.
The previous prime is 51677422477573. The next prime is 51677422477621. The reversal of 51677422477616 is 61677422477615.
It is a super-2 number, since 2×516774224776162 (a number of 28 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 52761446 + ... + 53731973.
It is an arithmetic number, because the mean of its divisors is an integer number (2696828718738).
Almost surely, 251677422477616 is an apocalyptic number.
It is an amenable number.
51677422477616 is an abundant number, since it is smaller than the sum of its proper divisors (56195726271904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51677422477616 is a wasteful number, since it uses less digits than its factorization.
51677422477616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106495773 (or 106495767 counting only the distinct ones).
The product of its digits is 165957120, while the sum is 65.
Subtracting 51677422477616 from its reverse (61677422477615), we obtain a palindrome (9999999999999).
The spelling of 51677422477616 in words is "fifty-one trillion, six hundred seventy-seven billion, four hundred twenty-two million, four hundred seventy-seven thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •