Base | Representation |
---|---|
bin | 100010100100010010001100… |
… | …1101011000110000100111101 |
3 | 1110212120021122120012211222000 |
4 | 1011020210121223012010331 |
5 | 304323110143412410323 |
6 | 2554400300312212513 |
7 | 121021115550325320 |
oct | 10510443153060475 |
9 | 1425507576184860 |
10 | 304054050513213 |
11 | 88976664929720 |
12 | 2a12786639a139 |
13 | 10087235199840 |
14 | 551241a4087b7 |
15 | 2524224ab0e43 |
hex | 1148919ac613d |
304054050513213 has 128 divisors (see below), whose sum is σ = 606627807744000. Its totient is φ = 145359656006400.
The previous prime is 304054050513121. The next prime is 304054050513217. The reversal of 304054050513213 is 312315050450403.
304054050513213 is a `hidden beast` number, since 3 + 0 + 4 + 0 + 5 + 4 + 0 + 505 + 132 + 13 = 666.
It is not a de Polignac number, because 304054050513213 - 210 = 304054050512189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304054050513217) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 8048038 + ... + 25939911.
It is an arithmetic number, because the mean of its divisors is an integer number (4739279748000).
Almost surely, 2304054050513213 is an apocalyptic number.
304054050513213 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
304054050513213 is a deficient number, since it is larger than the sum of its proper divisors (302573757230787).
304054050513213 is a wasteful number, since it uses less digits than its factorization.
304054050513213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33988320 (or 33988314 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 304054050513213 in words is "three hundred four trillion, fifty-four billion, fifty million, five hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •