Base | Representation |
---|---|
bin | 101111110011110000… |
… | …110110110111101001 |
3 | 11220111120120012202122 |
4 | 233303300312313221 |
5 | 1320113040431101 |
6 | 35325504241025 |
7 | 3465053306312 |
oct | 576360666751 |
9 | 156446505678 |
10 | 51334311401 |
11 | 1a852975a4a |
12 | 9b47910175 |
13 | 4ac132c1b9 |
14 | 26ada23609 |
15 | 1506ab151b |
hex | bf3c36de9 |
51334311401 has 8 divisors (see below), whose sum is σ = 53136949320. Its totient is φ = 49533839488.
The previous prime is 51334311383. The next prime is 51334311403. The reversal of 51334311401 is 10411343315.
It can be written as a sum of positive squares in 4 ways, for example, as 5001318400 + 46332993001 = 70720^2 + 215251^2 .
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-51334311401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51334311403) 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 7 ways as a sum of consecutive naturals, for example, 493196 + ... + 588141.
It is an arithmetic number, because the mean of its divisors is an integer number (6642118665).
Almost surely, 251334311401 is an apocalyptic number.
It is an amenable number.
51334311401 is a deficient number, since it is larger than the sum of its proper divisors (1802637919).
51334311401 is a wasteful number, since it uses less digits than its factorization.
51334311401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1083003.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 51334311401 its reverse (10411343315), we get a palindrome (61745654716).
The spelling of 51334311401 in words is "fifty-one billion, three hundred thirty-four million, three hundred eleven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •