Base | Representation |
---|---|
bin | 10111001100100101100010… |
… | …10000100010101101011001 |
3 | 20200121111201222201022102102 |
4 | 23212102301100202231121 |
5 | 23141221442402323001 |
6 | 300253401212413145 |
7 | 13513231326544145 |
oct | 1346226120425531 |
9 | 220544658638372 |
10 | 51010005511001 |
11 | 15287249312539 |
12 | 587a0b77771b5 |
13 | 22602b8888514 |
14 | c84c7c80a225 |
15 | 5d6d499c1e6b |
hex | 2e64b1422b59 |
51010005511001 has 8 divisors (see below), whose sum is σ = 51846666404544. Its totient is φ = 50173358530320.
The previous prime is 51010005510991. The next prime is 51010005511061. The reversal of 51010005511001 is 10011550001015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51010005511001 is a prime.
It is a super-2 number, since 2×510100055110012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51010005511061) 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, 4047140 + ... + 10881146.
It is an arithmetic number, because the mean of its divisors is an integer number (6480833300568).
Almost surely, 251010005511001 is an apocalyptic number.
It is an amenable number.
51010005511001 is a deficient number, since it is larger than the sum of its proper divisors (836660893543).
51010005511001 is a wasteful number, since it uses less digits than its factorization.
51010005511001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6956431.
The product of its (nonzero) digits is 125, while the sum is 20.
Adding to 51010005511001 its reverse (10011550001015), we get a palindrome (61021555512016).
The spelling of 51010005511001 in words is "fifty-one trillion, ten billion, five million, five hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •