Base | Representation |
---|---|
bin | 1111000111000111111011… |
… | …01011101111010001010001 |
3 | 11100122202202102011220210201 |
4 | 13203203331223233101101 |
5 | 13323420243003301223 |
6 | 154401412515255201 |
7 | 6666540266634043 |
oct | 743437553572121 |
9 | 140582672156721 |
10 | 33230123103313 |
11 | a6518a8203334 |
12 | 3888278baa501 |
13 | 1570782cc59b6 |
14 | 82c4bcc95a93 |
15 | 3c95d22d5ead |
hex | 1e38fdaef451 |
33230123103313 has 2 divisors, whose sum is σ = 33230123103314. Its totient is φ = 33230123103312.
The previous prime is 33230123103209. The next prime is 33230123103371. The reversal of 33230123103313 is 31330132103233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27327205816849 + 5902917286464 = 5227543^2 + 2429592^2 .
It is a cyclic number.
It is not a de Polignac number, because 33230123103313 - 233 = 33221533168721 is a prime.
It is a super-2 number, since 2×332301231033132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (33230123103383) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16615061551656 + 16615061551657.
It is an arithmetic number, because the mean of its divisors is an integer number (16615061551657).
Almost surely, 233230123103313 is an apocalyptic number.
It is an amenable number.
33230123103313 is a deficient number, since it is larger than the sum of its proper divisors (1).
33230123103313 is an equidigital number, since it uses as much as digits as its factorization.
33230123103313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 33230123103313 its reverse (31330132103233), we get a palindrome (64560255206546).
The spelling of 33230123103313 in words is "thirty-three trillion, two hundred thirty billion, one hundred twenty-three million, one hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •