Base | Representation |
---|---|
bin | 100010110100000111100111… |
… | …0001011010111110011111001 |
3 | 1111011021100000101101120222101 |
4 | 1011220033032023113303321 |
5 | 310114234210033400423 |
6 | 3003144134512223401 |
7 | 121334261052445060 |
oct | 10550171613276371 |
9 | 1434240011346871 |
10 | 306230332325113 |
11 | 89635611209959 |
12 | 2a4195a683ab61 |
13 | 101b451cc54041 |
14 | 55898acd3b1d7 |
15 | 2560b48b3b7ad |
hex | 11683ce2d7cf9 |
306230332325113 has 8 divisors (see below), whose sum is σ = 350147167619328. Its totient is φ = 262355908271424.
The previous prime is 306230332325087. The next prime is 306230332325173. The reversal of 306230332325113 is 311523233032603.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 306230332325113 - 213 = 306230332316921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (306230332325173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10602794656 + ... + 10602823537.
It is an arithmetic number, because the mean of its divisors is an integer number (43768395952416).
Almost surely, 2306230332325113 is an apocalyptic number.
It is an amenable number.
306230332325113 is a deficient number, since it is larger than the sum of its proper divisors (43916835294215).
306230332325113 is a wasteful number, since it uses less digits than its factorization.
306230332325113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21205620263.
The product of its (nonzero) digits is 174960, while the sum is 37.
Adding to 306230332325113 its reverse (311523233032603), we get a palindrome (617753565357716).
The spelling of 306230332325113 in words is "three hundred six trillion, two hundred thirty billion, three hundred thirty-two million, three hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •