Base | Representation |
---|---|
bin | 10111011111110101001111… |
… | …00000000101011001011101 |
3 | 20202221201120102110002220010 |
4 | 23233322213200011121131 |
5 | 23233040223243323134 |
6 | 301521241404313433 |
7 | 13612061105553231 |
oct | 1357724740053135 |
9 | 222851512402803 |
10 | 51671266776669 |
11 | 15511730034711 |
12 | 59662a2842879 |
13 | 22aa76c368447 |
14 | ca8c8cc605c1 |
15 | 5e914cb80ce9 |
hex | 2efea780565d |
51671266776669 has 32 divisors (see below), whose sum is σ = 69335119659520. Its totient is φ = 34228185380928.
The previous prime is 51671266776637. The next prime is 51671266776697. The reversal of 51671266776669 is 96667766217615.
It is not a de Polignac number, because 51671266776669 - 25 = 51671266776637 is a prime.
It is a super-2 number, since 2×516712667766692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 51671266776669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51671266776629) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3046107582 + ... + 3046124544.
It is an arithmetic number, because the mean of its divisors is an integer number (2166722489360).
Almost surely, 251671266776669 is an apocalyptic number.
It is an amenable number.
51671266776669 is a deficient number, since it is larger than the sum of its proper divisors (17663852882851).
51671266776669 is a wasteful number, since it uses less digits than its factorization.
51671266776669 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27241.
The product of its digits is 1440270720, while the sum is 75.
The spelling of 51671266776669 in words is "fifty-one trillion, six hundred seventy-one billion, two hundred sixty-six million, seven hundred seventy-six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •