Base | Representation |
---|---|
bin | 100010101011100011001001… |
… | …1101101010000000100000001 |
3 | 1111000002201220100010000122010 |
4 | 1011113012103231100010001 |
5 | 304440440040224431200 |
6 | 3000443110415403133 |
7 | 121153214035510221 |
oct | 10527062355200401 |
9 | 1430081810100563 |
10 | 305052530311425 |
11 | 892210627264a6 |
12 | 2a2692832234a9 |
13 | 1012a43a51bba0 |
14 | 554889a9b0081 |
15 | 25401b2b3c150 |
hex | 1157193b50101 |
305052530311425 has 24 divisors (see below), whose sum is σ = 543149941151104. Its totient is φ = 150179707229760.
The previous prime is 305052530311387. The next prime is 305052530311427. The reversal of 305052530311425 is 524113035250503.
It is not a de Polignac number, because 305052530311425 - 211 = 305052530309377 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (305052530311427) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 156437194057 + ... + 156437196006.
Almost surely, 2305052530311425 is an apocalyptic number.
It is an amenable number.
305052530311425 is a deficient number, since it is larger than the sum of its proper divisors (238097410839679).
305052530311425 is a wasteful number, since it uses less digits than its factorization.
305052530311425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312874390089 (or 312874390084 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 39.
Adding to 305052530311425 its reverse (524113035250503), we get a palindrome (829165565561928).
The spelling of 305052530311425 in words is "three hundred five trillion, fifty-two billion, five hundred thirty million, three hundred eleven thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •