Base | Representation |
---|---|
bin | 10111011000010000011110… |
… | …01000100111011101011101 |
3 | 20202000211210212000111020110 |
4 | 23230020033020213131131 |
5 | 23214304223141401031 |
6 | 301201520523040233 |
7 | 13554215546356611 |
oct | 1354101710473535 |
9 | 222024725014213 |
10 | 51411012450141 |
11 | 15421319278143 |
12 | 5923970070079 |
13 | 228c0649c3326 |
14 | c9a440605341 |
15 | 5e24b99bcc46 |
hex | 2ec20f22775d |
51411012450141 has 16 divisors (see below), whose sum is σ = 68937304117248. Its totient is φ = 34079522862000.
The previous prime is 51411012450139. The next prime is 51411012450271. The reversal of 51411012450141 is 14105421011415.
It is not a de Polignac number, because 51411012450141 - 21 = 51411012450139 is a prime.
It is a super-2 number, since 2×514110124501412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51411012450099 and 51411012450108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51411012455141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18489835 + ... + 21087816.
It is an arithmetic number, because the mean of its divisors is an integer number (4308581507328).
Almost surely, 251411012450141 is an apocalyptic number.
It is an amenable number.
51411012450141 is a deficient number, since it is larger than the sum of its proper divisors (17526291667107).
51411012450141 is a wasteful number, since it uses less digits than its factorization.
51411012450141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39580112.
The product of its (nonzero) digits is 3200, while the sum is 30.
Adding to 51411012450141 its reverse (14105421011415), we get a palindrome (65516433461556).
The spelling of 51411012450141 in words is "fifty-one trillion, four hundred eleven billion, twelve million, four hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •