Base | Representation |
---|---|
bin | 1000110110010000000… |
… | …00010101010111001111 |
3 | 1002001200111201202120222 |
4 | 10123020000111113033 |
5 | 14440044312211143 |
6 | 351353540301555 |
7 | 30651324626210 |
oct | 4331000252717 |
9 | 1061614652528 |
10 | 304003241423 |
11 | 107a219a4892 |
12 | 4ab020a18bb |
13 | 2288a31680b |
14 | 109dca9b407 |
15 | 7d93d74768 |
hex | 46c80155cf |
304003241423 has 8 divisors (see below), whose sum is σ = 350679307392. Its totient is φ = 258138933336.
The previous prime is 304003241327. The next prime is 304003241441. The reversal of 304003241423 is 324142300403.
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 304003241423 - 28 = 304003241167 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 304003241392 and 304003241401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304003241623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202938665 + ... + 202940162.
It is an arithmetic number, because the mean of its divisors is an integer number (43834913424).
Almost surely, 2304003241423 is an apocalyptic number.
304003241423 is a deficient number, since it is larger than the sum of its proper divisors (46676065969).
304003241423 is a wasteful number, since it uses less digits than its factorization.
304003241423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405878941.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 304003241423 its reverse (324142300403), we get a palindrome (628145541826).
The spelling of 304003241423 in words is "three hundred four billion, three million, two hundred forty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •