Base | Representation |
---|---|
bin | 10111001100100110100100… |
… | …10111111101111001011101 |
3 | 20200121120011201011102210111 |
4 | 23212103102113331321131 |
5 | 23141224112120334001 |
6 | 300253532301010021 |
7 | 13513251154166164 |
oct | 1346232227757135 |
9 | 220546151142714 |
10 | 51010561105501 |
11 | 152875039a0948 |
12 | 587a231853911 |
13 | 2260376a0726a |
14 | c84cd25143db |
15 | 5d6d7d66c851 |
hex | 2e64d25fde5d |
51010561105501 has 8 divisors (see below), whose sum is σ = 51259410316800. Its totient is φ = 50761891379472.
The previous prime is 51010561105477. The next prime is 51010561105529. The reversal of 51010561105501 is 10550116501015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51010561105501 - 231 = 51008413621853 is a prime.
It is a super-2 number, since 2×510105611055012 (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 (51010561105571) 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, 44301505 + ... + 45438358.
It is an arithmetic number, because the mean of its divisors is an integer number (6407426289600).
Almost surely, 251010561105501 is an apocalyptic number.
It is an amenable number.
51010561105501 is a deficient number, since it is larger than the sum of its proper divisors (248849211299).
51010561105501 is a wasteful number, since it uses less digits than its factorization.
51010561105501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89742635.
The product of its (nonzero) digits is 3750, while the sum is 31.
Adding to 51010561105501 its reverse (10550116501015), we get a palindrome (61560677606516).
The spelling of 51010561105501 in words is "fifty-one trillion, ten billion, five hundred sixty-one million, one hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •