Base | Representation |
---|---|
bin | 10001000101010100011010… |
… | …000100010000011010000001 |
3 | 100212000120121011222001101021 |
4 | 101011110122010100122001 |
5 | 34321431422324413241 |
6 | 423443145141105441 |
7 | 21553062303562213 |
oct | 2105243204203201 |
9 | 325016534861337 |
10 | 75132300232321 |
11 | 21a3747a871362 |
12 | 85151873b8281 |
13 | 32bcc3a3995b7 |
14 | 147a5cbda65b3 |
15 | 8a456be960d1 |
hex | 44551a110681 |
75132300232321 has 2 divisors, whose sum is σ = 75132300232322. Its totient is φ = 75132300232320.
The previous prime is 75132300232303. The next prime is 75132300232391. The reversal of 75132300232321 is 12323200323157.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70488382981696 + 4643917250625 = 8395736^2 + 2154975^2 .
It is an emirp because it is prime and its reverse (12323200323157) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 75132300232321 - 217 = 75132300101249 is a prime.
It is not a weakly prime, because it can be changed into another prime (75132300232391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37566150116160 + 37566150116161.
It is an arithmetic number, because the mean of its divisors is an integer number (37566150116161).
Almost surely, 275132300232321 is an apocalyptic number.
It is an amenable number.
75132300232321 is a deficient number, since it is larger than the sum of its proper divisors (1).
75132300232321 is an equidigital number, since it uses as much as digits as its factorization.
75132300232321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 34.
Adding to 75132300232321 its reverse (12323200323157), we get a palindrome (87455500555478).
The spelling of 75132300232321 in words is "seventy-five trillion, one hundred thirty-two billion, three hundred million, two hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •