Base | Representation |
---|---|
bin | 111110000001001011101001… |
… | …1100010100111010011010101 |
3 | 2122112112020001210120211100202 |
4 | 1330002113103202213103111 |
5 | 1033000300412414431201 |
6 | 5212120311205550245 |
7 | 222622351565014241 |
oct | 17402272342472325 |
9 | 2575466053524322 |
10 | 545520230233301 |
11 | 148901915313574 |
12 | 51225585415385 |
13 | 1a55144c45960b |
14 | 989d46a1d9421 |
15 | 4310376a17c6b |
hex | 1f025d38a74d5 |
545520230233301 has 2 divisors, whose sum is σ = 545520230233302. Its totient is φ = 545520230233300.
The previous prime is 545520230233243. The next prime is 545520230233337. The reversal of 545520230233301 is 103332032025545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 490999343835025 + 54520886398276 = 22158505^2 + 7383826^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-545520230233301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (545520230233201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 272760115116650 + 272760115116651.
It is an arithmetic number, because the mean of its divisors is an integer number (272760115116651).
Almost surely, 2545520230233301 is an apocalyptic number.
It is an amenable number.
545520230233301 is a deficient number, since it is larger than the sum of its proper divisors (1).
545520230233301 is an equidigital number, since it uses as much as digits as its factorization.
545520230233301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 38.
Adding to 545520230233301 its reverse (103332032025545), we get a palindrome (648852262258846).
The spelling of 545520230233301 in words is "five hundred forty-five trillion, five hundred twenty billion, two hundred thirty million, two hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •