Base | Representation |
---|---|
bin | 1000111000110000000… |
… | …11010111010111001101 |
3 | 1002012011002202210201001 |
4 | 10130120003113113031 |
5 | 20000322112311300 |
6 | 352135113020301 |
7 | 31026522663166 |
oct | 4343003272715 |
9 | 1065132683631 |
10 | 305346213325 |
11 | 108550a8251a |
12 | 4b2179b4691 |
13 | 22a42618c4a |
14 | 10ac91a676d |
15 | 7e21c0216a |
hex | 47180d75cd |
305346213325 has 6 divisors (see below), whose sum is σ = 378629304554. Its totient is φ = 244276970640.
The previous prime is 305346213317. The next prime is 305346213331. The reversal of 305346213325 is 523312643503.
It can be written as a sum of positive squares in 3 ways, for example, as 39472947684 + 265873265641 = 198678^2 + 515629^2 .
It is not a de Polignac number, because 305346213325 - 23 = 305346213317 is a prime.
It is a Duffinian number.
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 5 ways as a sum of consecutive naturals, for example, 6106924242 + ... + 6106924291.
Almost surely, 2305346213325 is an apocalyptic number.
It is an amenable number.
305346213325 is a deficient number, since it is larger than the sum of its proper divisors (73283091229).
305346213325 is a wasteful number, since it uses less digits than its factorization.
305346213325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12213848543 (or 12213848538 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 37.
Adding to 305346213325 its reverse (523312643503), we get a palindrome (828658856828).
It can be divided in two parts, 305346 and 213325, that added together give a triangular number (518671 = T1018).
The spelling of 305346213325 in words is "three hundred five billion, three hundred forty-six million, two hundred thirteen thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •