Base | Representation |
---|---|
bin | 1000111000101011001… |
… | …11011010001010010101 |
3 | 1002012001020211201202212 |
4 | 10130111213122022111 |
5 | 20000231131032300 |
6 | 352131052443205 |
7 | 31025515326602 |
oct | 4342547321225 |
9 | 1065036751685 |
10 | 305305330325 |
11 | 10852a999516 |
12 | 4b206179505 |
13 | 22a37003518 |
14 | 10ac39a36a9 |
15 | 7e1d328935 |
hex | 47159da295 |
305305330325 has 48 divisors (see below), whose sum is σ = 390780702720. Its totient is φ = 236516280000.
The previous prime is 305305330313. The next prime is 305305330339. The reversal of 305305330325 is 523033503503.
It is not a de Polignac number, because 305305330325 - 230 = 304231588501 is a prime.
It is a super-2 number, since 2×3053053303252 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 305305330291 and 305305330300.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 42690500 + ... + 42697650.
It is an arithmetic number, because the mean of its divisors is an integer number (8141264640).
Almost surely, 2305305330325 is an apocalyptic number.
It is an amenable number.
305305330325 is a deficient number, since it is larger than the sum of its proper divisors (85475372395).
305305330325 is a wasteful number, since it uses less digits than its factorization.
305305330325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7658 (or 7653 counting only the distinct ones).
The product of its (nonzero) digits is 60750, while the sum is 32.
Adding to 305305330325 its reverse (523033503503), we get a palindrome (828338833828).
The spelling of 305305330325 in words is "three hundred five billion, three hundred five million, three hundred thirty thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •