Base | Representation |
---|---|
bin | 1000110111000000100… |
… | …00011011001111110101 |
3 | 1002002201212022222111010 |
4 | 10123200100123033311 |
5 | 14441412442104023 |
6 | 351502153102433 |
7 | 30664365160566 |
oct | 4334020331765 |
9 | 1062655288433 |
10 | 304410113013 |
11 | 1081106334a6 |
12 | 4abb63b7a19 |
13 | 229236c2a36 |
14 | 10a3ab3016d |
15 | 7db9944093 |
hex | 46e041b3f5 |
304410113013 has 4 divisors (see below), whose sum is σ = 405880150688. Its totient is φ = 202940075340.
The previous prime is 304410112999. The next prime is 304410113053. The reversal of 304410113013 is 310311014403.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 304410113013 - 24 = 304410112997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304410113053) 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 3 ways as a sum of consecutive naturals, for example, 50735018833 + ... + 50735018838.
It is an arithmetic number, because the mean of its divisors is an integer number (101470037672).
Almost surely, 2304410113013 is an apocalyptic number.
It is an amenable number.
304410113013 is a deficient number, since it is larger than the sum of its proper divisors (101470037675).
304410113013 is a wasteful number, since it uses less digits than its factorization.
304410113013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101470037674.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 304410113013 its reverse (310311014403), we get a palindrome (614721127416).
The spelling of 304410113013 in words is "three hundred four billion, four hundred ten million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •