Base | Representation |
---|---|
bin | 101111100110000011… |
… | …100111111101001111 |
3 | 11212220112211222001212 |
4 | 233212003213331033 |
5 | 1314130203200111 |
6 | 35251011325035 |
7 | 3456261544100 |
oct | 574603477517 |
9 | 155815758055 |
10 | 51104350031 |
11 | 1a745089629 |
12 | 9aa28b077b |
13 | 4a857b4697 |
14 | 268b2823a7 |
15 | 14e17d998b |
hex | be60e7f4f |
51104350031 has 12 divisors (see below), whose sum is σ = 60335203608. Its totient is φ = 43149938832.
The previous prime is 51104350009. The next prime is 51104350057. The reversal of 51104350031 is 13005340115.
It is not a de Polignac number, because 51104350031 - 214 = 51104333647 is a prime.
It is a super-2 number, since 2×511043500312 (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 = 51104349979 and 51104350006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51104350081) 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 11 ways as a sum of consecutive naturals, for example, 7779896 + ... + 7786461.
It is an arithmetic number, because the mean of its divisors is an integer number (5027933634).
Almost surely, 251104350031 is an apocalyptic number.
51104350031 is a deficient number, since it is larger than the sum of its proper divisors (9230853577).
51104350031 is a wasteful number, since it uses less digits than its factorization.
51104350031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15566438 (or 15566431 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 51104350031 its reverse (13005340115), we get a palindrome (64109690146).
The spelling of 51104350031 in words is "fifty-one billion, one hundred four million, three hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •