Base | Representation |
---|---|
bin | 10111001100100101101000… |
… | …01101010110001110000101 |
3 | 20200121111212102211212111202 |
4 | 23212102310031112032011 |
5 | 23141222043040130221 |
6 | 300253410141312245 |
7 | 13513232500333535 |
oct | 1346226415261605 |
9 | 220544772755452 |
10 | 51010055005061 |
11 | 15287274248119 |
12 | 587a110265685 |
13 | 22602c5bc7549 |
14 | c84c852114c5 |
15 | 5d6d4deebd0b |
hex | 2e64b4356385 |
51010055005061 has 4 divisors (see below), whose sum is σ = 51011272383552. Its totient is φ = 51008837626572.
The previous prime is 51010055005057. The next prime is 51010055005069. The reversal of 51010055005061 is 16050055001015.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 51010055005061 - 22 = 51010055005057 is a prime.
It is a super-2 number, since 2×510100550050612 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51010055005069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 608626391 + ... + 608710196.
It is an arithmetic number, because the mean of its divisors is an integer number (12752818095888).
Almost surely, 251010055005061 is an apocalyptic number.
It is an amenable number.
51010055005061 is a deficient number, since it is larger than the sum of its proper divisors (1217378491).
51010055005061 is a wasteful number, since it uses less digits than its factorization.
51010055005061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1217378490.
The product of its (nonzero) digits is 3750, while the sum is 29.
The spelling of 51010055005061 in words is "fifty-one trillion, ten billion, fifty-five million, five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •