Base | Representation |
---|---|
bin | 1111000001010011110000… |
… | …00001101111110101011001 |
3 | 11022221200000020202212200001 |
4 | 13200221320001233311121 |
5 | 13312132034412331413 |
6 | 154125525503013001 |
7 | 6646234633350343 |
oct | 740517001576531 |
9 | 138850006685601 |
10 | 33030312230233 |
11 | a585093178a7a |
12 | 38555b489a161 |
13 | 155798bc24a56 |
14 | 822965d66293 |
15 | 3c42da76e4dd |
hex | 1e0a7806fd59 |
33030312230233 has 2 divisors, whose sum is σ = 33030312230234. Its totient is φ = 33030312230232.
The previous prime is 33030312230189. The next prime is 33030312230243. The reversal of 33030312230233 is 33203221303033.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31706505507609 + 1323806722624 = 5630853^2 + 1150568^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33030312230233 is a prime.
It is not a weakly prime, because it can be changed into another prime (33030312230243) 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, 16515156115116 + 16515156115117.
It is an arithmetic number, because the mean of its divisors is an integer number (16515156115117).
Almost surely, 233030312230233 is an apocalyptic number.
It is an amenable number.
33030312230233 is a deficient number, since it is larger than the sum of its proper divisors (1).
33030312230233 is an equidigital number, since it uses as much as digits as its factorization.
33030312230233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 33030312230233 its reverse (33203221303033), we get a palindrome (66233533533266).
The spelling of 33030312230233 in words is "thirty-three trillion, thirty billion, three hundred twelve million, two hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •