Base | Representation |
---|---|
bin | 1000110110111111100… |
… | …01100001110100000001 |
3 | 1002002201022002110221222 |
4 | 10123133301201310001 |
5 | 14441403403412231 |
6 | 351501303324425 |
7 | 30664236264641 |
oct | 4333761416401 |
9 | 1062638073858 |
10 | 304402013441 |
11 | 108107001139 |
12 | 4abb3750715 |
13 | 22921b181a6 |
14 | 10a39a22521 |
15 | 7db8d9427b |
hex | 46dfc61d01 |
304402013441 has 8 divisors (see below), whose sum is σ = 305960803200. Its totient is φ = 302843515392.
The previous prime is 304402013407. The next prime is 304402013453. The reversal of 304402013441 is 144310204403.
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 304402013441 - 238 = 29524106497 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 304402013441.
It is not an unprimeable number, because it can be changed into a prime (304402013341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2200076 + ... + 2334338.
It is an arithmetic number, because the mean of its divisors is an integer number (38245100400).
Almost surely, 2304402013441 is an apocalyptic number.
It is an amenable number.
304402013441 is a deficient number, since it is larger than the sum of its proper divisors (1558789759).
304402013441 is a wasteful number, since it uses less digits than its factorization.
304402013441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145855.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 304402013441 its reverse (144310204403), we get a palindrome (448712217844).
The spelling of 304402013441 in words is "three hundred four billion, four hundred two million, thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •