Base | Representation |
---|---|
bin | 10111011011011101111010… |
… | …00001111101101111110001 |
3 | 20202102101111021021001110220 |
4 | 23231232331001331233301 |
5 | 23223111112323440101 |
6 | 301324321012243253 |
7 | 13565201642212416 |
oct | 1355567501755761 |
9 | 222371437231426 |
10 | 51521304124401 |
11 | 15464076025461 |
12 | 5941210610529 |
13 | 2299590764547 |
14 | ca190443210d |
15 | 5e52c24cc636 |
hex | 2edbbd07dbf1 |
51521304124401 has 8 divisors (see below), whose sum is σ = 68702118576000. Its totient is φ = 34344012877872.
The previous prime is 51521304124397. The next prime is 51521304124417. The reversal of 51521304124401 is 10442140312515.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51521304124401 - 22 = 51521304124397 is a prime.
It is a super-4 number, since 4×515213041244014 (a number of 56 digits) contains 4444 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51521304124421) 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, 880767145 + ... + 880825638.
It is an arithmetic number, because the mean of its divisors is an integer number (8587764822000).
Almost surely, 251521304124401 is an apocalyptic number.
It is an amenable number.
51521304124401 is a deficient number, since it is larger than the sum of its proper divisors (17180814451599).
51521304124401 is a wasteful number, since it uses less digits than its factorization.
51521304124401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1761602535.
The product of its (nonzero) digits is 19200, while the sum is 33.
Adding to 51521304124401 its reverse (10442140312515), we get a palindrome (61963444436916).
The spelling of 51521304124401 in words is "fifty-one trillion, five hundred twenty-one billion, three hundred four million, one hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •