Base | Representation |
---|---|
bin | 101111100010100111… |
… | …110000110001001001 |
3 | 11212202112101202220101 |
4 | 233202213300301021 |
5 | 1314020424330231 |
6 | 35241152125401 |
7 | 3454661625232 |
oct | 574247606111 |
9 | 155675352811 |
10 | 51046714441 |
11 | 1a7155a3108 |
12 | 9a87536861 |
13 | 4a76884998 |
14 | 268375c089 |
15 | 14db702661 |
hex | be29f0c49 |
51046714441 has 4 divisors (see below), whose sum is σ = 53266136832. Its totient is φ = 48827292052.
The previous prime is 51046714423. The next prime is 51046714471. The reversal of 51046714441 is 14441764015.
51046714441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 51046714441 - 25 = 51046714409 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51046714441.
It is not an unprimeable number, because it can be changed into a prime (51046714471) 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, 1109711161 + ... + 1109711206.
It is an arithmetic number, because the mean of its divisors is an integer number (13316534208).
Almost surely, 251046714441 is an apocalyptic number.
It is an amenable number.
51046714441 is a deficient number, since it is larger than the sum of its proper divisors (2219422391).
51046714441 is a wasteful number, since it uses less digits than its factorization.
51046714441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2219422390.
The product of its (nonzero) digits is 53760, while the sum is 37.
The spelling of 51046714441 in words is "fifty-one billion, forty-six million, seven hundred fourteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •