Base | Representation |
---|---|
bin | 1000111010111110101… |
… | …10100101001101110001 |
3 | 1002022020110200001210112 |
4 | 10131133112211031301 |
5 | 20010244330330022 |
6 | 352453524111105 |
7 | 31101256455413 |
oct | 4353726451561 |
9 | 1068213601715 |
10 | 306542433137 |
11 | 109005237136 |
12 | 4b4b0535495 |
13 | 22ba33b8915 |
14 | 10b9ddd09b3 |
15 | 7e91c428e2 |
hex | 475f5a5371 |
306542433137 has 2 divisors, whose sum is σ = 306542433138. Its totient is φ = 306542433136.
The previous prime is 306542433017. The next prime is 306542433139. The reversal of 306542433137 is 731334245603.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 221599913536 + 84942519601 = 470744^2 + 291449^2 .
It is a cyclic number.
It is not a de Polignac number, because 306542433137 - 214 = 306542416753 is a prime.
Together with 306542433139, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 306542433094 and 306542433103.
It is not a weakly prime, because it can be changed into another prime (306542433139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 153271216568 + 153271216569.
It is an arithmetic number, because the mean of its divisors is an integer number (153271216569).
Almost surely, 2306542433137 is an apocalyptic number.
It is an amenable number.
306542433137 is a deficient number, since it is larger than the sum of its proper divisors (1).
306542433137 is an equidigital number, since it uses as much as digits as its factorization.
306542433137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 544320, while the sum is 41.
The spelling of 306542433137 in words is "three hundred six billion, five hundred forty-two million, four hundred thirty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •