Base | Representation |
---|---|
bin | 10111011001100111001… |
… | …01101110001111111011 |
3 | 2211212022211210000012202 |
4 | 23230303211232033323 |
5 | 101133120222124011 |
6 | 1413210321300415 |
7 | 112042321506044 |
oct | 13546345561773 |
9 | 2755284700182 |
10 | 804024411131 |
11 | 28aa91901407 |
12 | 10b9aa19470b |
13 | 5aa85967236 |
14 | 2acb4a318cb |
15 | 15dab78a23b |
hex | bb3396e3fb |
804024411131 has 8 divisors (see below), whose sum is σ = 831332288304. Its totient is φ = 777083082880.
The previous prime is 804024411109. The next prime is 804024411133. The reversal of 804024411131 is 131114420408.
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 804024411131 - 26 = 804024411067 is a prime.
It is a super-2 number, since 2×8040244111312 (a number of 25 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 = 804024411094 and 804024411103.
It is not an unprimeable number, because it can be changed into a prime (804024411133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91632770 + ... + 91641543.
It is an arithmetic number, because the mean of its divisors is an integer number (103916536038).
Almost surely, 2804024411131 is an apocalyptic number.
804024411131 is a deficient number, since it is larger than the sum of its proper divisors (27307877173).
804024411131 is a wasteful number, since it uses less digits than its factorization.
804024411131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183274461.
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 804024411131 its reverse (131114420408), we get a palindrome (935138831539).
The spelling of 804024411131 in words is "eight hundred four billion, twenty-four million, four hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •