Base | Representation |
---|---|
bin | 1000110111000000100… |
… | …11110100110011000111 |
3 | 1002002201221000020211110 |
4 | 10123200103310303013 |
5 | 14441413204112403 |
6 | 351502224140103 |
7 | 30664405561533 |
oct | 4334023646307 |
9 | 1062657006743 |
10 | 304411004103 |
11 | 108111091a38 |
12 | 4abb6767633 |
13 | 229239454cb |
14 | 10a3acc2bc3 |
15 | 7db9a6d103 |
hex | 46e04f4cc7 |
304411004103 has 8 divisors (see below), whose sum is σ = 413539477488. Its totient is φ = 199111600064.
The previous prime is 304411004057. The next prime is 304411004137. The reversal of 304411004103 is 301400114403.
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 304411004103 - 26 = 304411004039 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 304411004103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304411005103) 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, 957267150 + ... + 957267467.
It is an arithmetic number, because the mean of its divisors is an integer number (51692434686).
Almost surely, 2304411004103 is an apocalyptic number.
304411004103 is a deficient number, since it is larger than the sum of its proper divisors (109128473385).
304411004103 is a wasteful number, since it uses less digits than its factorization.
304411004103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1914534673.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 304411004103 its reverse (301400114403), we get a palindrome (605811118506).
The spelling of 304411004103 in words is "three hundred four billion, four hundred eleven million, four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •