Base | Representation |
---|---|
bin | 1001101010111101010… |
… | …01001010110000101001 |
3 | 1011202201120200220111102 |
4 | 10311132221022300221 |
5 | 20421022341111243 |
6 | 412353501211145 |
7 | 33002466134603 |
oct | 4653651126051 |
9 | 1152646626442 |
10 | 332300332073 |
11 | 118a22968916 |
12 | 5449a860ab5 |
13 | 25449954038 |
14 | 12124ca4173 |
15 | 899d2229b8 |
hex | 4d5ea4ac29 |
332300332073 has 2 divisors, whose sum is σ = 332300332074. Its totient is φ = 332300332072.
The previous prime is 332300332051. The next prime is 332300332123. The reversal of 332300332073 is 370233003233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 316567145449 + 15733186624 = 562643^2 + 125432^2 .
It is an emirp because it is prime and its reverse (370233003233) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 332300332073 - 224 = 332283554857 is a prime.
It is a super-2 number, since 2×3323003320732 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (332300332873) 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 as a sum of consecutive naturals, namely, 166150166036 + 166150166037.
It is an arithmetic number, because the mean of its divisors is an integer number (166150166037).
Almost surely, 2332300332073 is an apocalyptic number.
It is an amenable number.
332300332073 is a deficient number, since it is larger than the sum of its proper divisors (1).
332300332073 is an equidigital number, since it uses as much as digits as its factorization.
332300332073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20412, while the sum is 29.
The spelling of 332300332073 in words is "three hundred thirty-two billion, three hundred million, three hundred thirty-two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •