Base | Representation |
---|---|
bin | 1000110110011011111… |
… | …10011010111101000011 |
3 | 1002001221111012111220021 |
4 | 10123031332122331003 |
5 | 14440300432401311 |
6 | 351411515154311 |
7 | 30653652164350 |
oct | 4331576327503 |
9 | 1061844174807 |
10 | 304103403331 |
11 | 107a73496a22 |
12 | 4ab2b745997 |
13 | 228a4cb5c10 |
14 | 10a0c0d1627 |
15 | 7d9ca5c171 |
hex | 46cdf9af43 |
304103403331 has 16 divisors (see below), whose sum is σ = 374295285504. Its totient is φ = 240600174624.
The previous prime is 304103403283. The next prime is 304103403341. The reversal of 304103403331 is 133304301403.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 304103403331 - 27 = 304103403203 is a prime.
It is a super-2 number, since 2×3041034033312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 304103403296 and 304103403305.
It is not an unprimeable number, because it can be changed into a prime (304103403341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3372276 + ... + 3461278.
It is an arithmetic number, because the mean of its divisors is an integer number (23393455344).
Almost surely, 2304103403331 is an apocalyptic number.
304103403331 is a deficient number, since it is larger than the sum of its proper divisors (70191882173).
304103403331 is a wasteful number, since it uses less digits than its factorization.
304103403331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126570.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 304103403331 its reverse (133304301403), we get a palindrome (437407704734).
The spelling of 304103403331 in words is "three hundred four billion, one hundred three million, four hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •