Base | Representation |
---|---|
bin | 10111001100101011001011… |
… | …00111110100101111011011 |
3 | 20200121210112212200010212102 |
4 | 23212111211213310233123 |
5 | 23141244142031404201 |
6 | 300255021350234015 |
7 | 13513366322254436 |
oct | 1346254547645733 |
9 | 220553485603772 |
10 | 51013031513051 |
11 | 15288561422683 |
12 | 587a80105590b |
13 | 226067b77508a |
14 | c8508866081d |
15 | 5d6e754a026b |
hex | 2e65659f4bdb |
51013031513051 has 4 divisors (see below), whose sum is σ = 51211525799352. Its totient is φ = 50814537226752.
The previous prime is 51013031513039. The next prime is 51013031513057. The reversal of 51013031513051 is 15031513031015.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51013031513051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51013031513057) 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, 99247142765 + ... + 99247143278.
It is an arithmetic number, because the mean of its divisors is an integer number (12802881449838).
Almost surely, 251013031513051 is an apocalyptic number.
51013031513051 is a deficient number, since it is larger than the sum of its proper divisors (198494286301).
51013031513051 is a wasteful number, since it uses less digits than its factorization.
51013031513051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198494286300.
The product of its (nonzero) digits is 3375, while the sum is 29.
Adding to 51013031513051 its reverse (15031513031015), we get a palindrome (66044544544066).
The spelling of 51013031513051 in words is "fifty-one trillion, thirteen billion, thirty-one million, five hundred thirteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •