Base | Representation |
---|---|
bin | 101111110111110000… |
… | …110011010010110111 |
3 | 11220200020210221201211 |
4 | 233313300303102313 |
5 | 1320232224434443 |
6 | 35340302302251 |
7 | 3466526511301 |
oct | 576760632267 |
9 | 156606727654 |
10 | 51401405623 |
11 | 1a887831917 |
12 | 9b66287987 |
13 | 4b021c1219 |
14 | 26b88ca971 |
15 | 150c91619d |
hex | bf7c334b7 |
51401405623 has 8 divisors (see below), whose sum is σ = 52909815888. Its totient is φ = 49899268224.
The previous prime is 51401405611. The next prime is 51401405633. The reversal of 51401405623 is 32650410415.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51401405623 - 229 = 50864534711 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51401405633) 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, 1551586 + ... + 1584367.
It is an arithmetic number, because the mean of its divisors is an integer number (6613726986).
Almost surely, 251401405623 is an apocalyptic number.
51401405623 is a deficient number, since it is larger than the sum of its proper divisors (1508410265).
51401405623 is a wasteful number, since it uses less digits than its factorization.
51401405623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3136433.
The product of its (nonzero) digits is 14400, while the sum is 31.
The spelling of 51401405623 in words is "fifty-one billion, four hundred one million, four hundred five thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •