Base | Representation |
---|---|
bin | 1111000110010000111101… |
… | …01100101011110010100001 |
3 | 11100112221120202021010201021 |
4 | 13203020132230223302201 |
5 | 13322424323212301012 |
6 | 154340052315005441 |
7 | 6664444056426325 |
oct | 743103654536241 |
9 | 140487522233637 |
10 | 33200612228257 |
11 | a6403340790a1 |
12 | 3882601a39881 |
13 | 156aa5c078a56 |
14 | 82acbd7b1985 |
15 | 3c89565c8007 |
hex | 1e321eb2bca1 |
33200612228257 has 2 divisors, whose sum is σ = 33200612228258. Its totient is φ = 33200612228256.
The previous prime is 33200612228243. The next prime is 33200612228297. The reversal of 33200612228257 is 75282221600233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27783430458001 + 5417181770256 = 5270999^2 + 2327484^2 .
It is a cyclic number.
It is not a de Polignac number, because 33200612228257 - 223 = 33200603839649 is a prime.
It is a super-2 number, since 2×332006122282572 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (33200612228207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16600306114128 + 16600306114129.
It is an arithmetic number, because the mean of its divisors is an integer number (16600306114129).
Almost surely, 233200612228257 is an apocalyptic number.
It is an amenable number.
33200612228257 is a deficient number, since it is larger than the sum of its proper divisors (1).
33200612228257 is an equidigital number, since it uses as much as digits as its factorization.
33200612228257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 483840, while the sum is 43.
The spelling of 33200612228257 in words is "thirty-three trillion, two hundred billion, six hundred twelve million, two hundred twenty-eight thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •