Base | Representation |
---|---|
bin | 101111100001111011… |
… | …110101101101001011 |
3 | 11212201201201210111212 |
4 | 233201323311231023 |
5 | 1314010002402311 |
6 | 35240101243335 |
7 | 3454462021343 |
oct | 574173655513 |
9 | 155651653455 |
10 | 51035200331 |
11 | 1a70a049415 |
12 | 9a8370354b |
13 | 4a74382bbb |
14 | 2682001d23 |
15 | 14da6cac8b |
hex | be1ef5b4b |
51035200331 has 4 divisors (see below), whose sum is σ = 51036181392. Its totient is φ = 51034219272.
The previous prime is 51035200301. The next prime is 51035200339. The reversal of 51035200331 is 13300253015.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51035200331 - 26 = 51035200267 is a prime.
It is a super-2 number, since 2×510352003312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51035200297 and 51035200306.
It is not an unprimeable number, because it can be changed into a prime (51035200339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 407855 + ... + 518088.
It is an arithmetic number, because the mean of its divisors is an integer number (12759045348).
Almost surely, 251035200331 is an apocalyptic number.
51035200331 is a deficient number, since it is larger than the sum of its proper divisors (981061).
51035200331 is an equidigital number, since it uses as much as digits as its factorization.
51035200331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 981060.
The product of its (nonzero) digits is 1350, while the sum is 23.
Adding to 51035200331 its reverse (13300253015), we get a palindrome (64335453346).
The spelling of 51035200331 in words is "fifty-one billion, thirty-five million, two hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •