Base | Representation |
---|---|
bin | 1000111010100111001… |
… | …11111001010010101001 |
3 | 1002021201202101012112100 |
4 | 10131103213321102221 |
5 | 20004343441121400 |
6 | 352422214204013 |
7 | 31063350006624 |
oct | 4352347712251 |
9 | 1067652335470 |
10 | 306345645225 |
11 | 108a141484a4 |
12 | 4b456653609 |
13 | 22b716b7679 |
14 | 10b81c06dbb |
15 | 7e7e820100 |
hex | 47539f94a9 |
306345645225 has 27 divisors (see below), whose sum is σ = 548713959703. Its totient is φ = 163379916240.
The previous prime is 306345645181. The next prime is 306345645239. The reversal of 306345645225 is 522546543603.
The square root of 306345645225 is 553485.
It is a perfect power (a square), and thus also a powerful number.
306345645225 is a `hidden beast` number, since 3 + 0 + 6 + 34 + 564 + 52 + 2 + 5 = 666.
It can be written as a sum of positive squares in only one way, i.e., 110284432281 + 196061212944 = 332091^2 + 442788^2 .
It is not a de Polignac number, because 306345645225 - 27 = 306345645097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 8283826 + ... + 8320724.
Almost surely, 2306345645225 is an apocalyptic number.
306345645225 is the 553485-th square number.
306345645225 is the 276743-rd centered octagonal number.
It is an amenable number.
306345645225 is a deficient number, since it is larger than the sum of its proper divisors (242368314478).
306345645225 is an frugal number, since it uses more digits than its factorization.
306345645225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73814 (or 36907 counting only the distinct ones).
The product of its (nonzero) digits is 2592000, while the sum is 45.
The spelling of 306345645225 in words is "three hundred six billion, three hundred forty-five million, six hundred forty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •