Base | Representation |
---|---|
bin | 10111011000010010110001… |
… | …10101011101010110101101 |
3 | 20202000222000000200210012010 |
4 | 23230021120311131112231 |
5 | 23214314241212120442 |
6 | 301202243333231433 |
7 | 13554261312362256 |
oct | 1354113065352655 |
9 | 222028000623163 |
10 | 51412248941997 |
11 | 154218a3238839 |
12 | 5924056192579 |
13 | 228c200c23608 |
14 | c9a51a913b2d |
15 | 5e253d315b9c |
hex | 2ec258d5d5ad |
51412248941997 has 32 divisors (see below), whose sum is σ = 69371807662080. Its totient is φ = 33866250102720.
The previous prime is 51412248941981. The next prime is 51412248942013. The reversal of 51412248941997 is 79914984221415.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (51412248941981) and next prime (51412248942013).
It is not a de Polignac number, because 51412248941997 - 24 = 51412248941981 is a prime.
It is a super-3 number, since 3×514122489419973 (a number of 42 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51412248941927) 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, 91580404 + ... + 92140082.
It is an arithmetic number, because the mean of its divisors is an integer number (2167868989440).
Almost surely, 251412248941997 is an apocalyptic number.
It is an amenable number.
51412248941997 is a deficient number, since it is larger than the sum of its proper divisors (17959558720083).
51412248941997 is a wasteful number, since it uses less digits than its factorization.
51412248941997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560793.
The product of its digits is 52254720, while the sum is 66.
The spelling of 51412248941997 in words is "fifty-one trillion, four hundred twelve billion, two hundred forty-eight million, nine hundred forty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •