Base | Representation |
---|---|
bin | 100010100100010010101010… |
… | …0101110101101000011100011 |
3 | 1110212120101012121120210120002 |
4 | 1011020211110232231003203 |
5 | 304323114211034040133 |
6 | 2554400542504410215 |
7 | 121021152241106354 |
oct | 10510452456550343 |
9 | 1425511177523502 |
10 | 304055041315043 |
11 | 8897702313a807 |
12 | 2a127aa217696b |
13 | 10087362536105 |
14 | 55124b1c3dd2b |
15 | 2524281a76ce8 |
hex | 1148954bad0e3 |
304055041315043 has 4 divisors (see below), whose sum is σ = 304055101250040. Its totient is φ = 304054981380048.
The previous prime is 304055041315007. The next prime is 304055041315063. The reversal of 304055041315043 is 340513140550403.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 304055041315043 - 240 = 302955529687267 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 304055041314988 and 304055041315006.
It is not an unprimeable number, because it can be changed into a prime (304055041315063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21574298 + ... + 32765231.
It is an arithmetic number, because the mean of its divisors is an integer number (76013775312510).
Almost surely, 2304055041315043 is an apocalyptic number.
304055041315043 is a deficient number, since it is larger than the sum of its proper divisors (59934997).
304055041315043 is an equidigital number, since it uses as much as digits as its factorization.
304055041315043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59934996.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 304055041315043 its reverse (340513140550403), we get a palindrome (644568181865446).
The spelling of 304055041315043 in words is "three hundred four trillion, fifty-five billion, forty-one million, three hundred fifteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •