Base | Representation |
---|---|
bin | 101111101001011010… |
… | …0001001001011001001 |
3 | 100210002221021002002012 |
4 | 1133102310021023021 |
5 | 3134023202212413 |
6 | 115001120545305 |
7 | 10251420162605 |
oct | 1372264111311 |
9 | 323087232065 |
10 | 102321132233 |
11 | 3a437680101 |
12 | 179b7182235 |
13 | 9858673478 |
14 | 4d49430505 |
15 | 29dcdd27a8 |
hex | 17d2d092c9 |
102321132233 has 2 divisors, whose sum is σ = 102321132234. Its totient is φ = 102321132232.
The previous prime is 102321132209. The next prime is 102321132239. The reversal of 102321132233 is 332231123201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75596402704 + 26724729529 = 274948^2 + 163477^2 .
It is a cyclic number.
It is not a de Polignac number, because 102321132233 - 28 = 102321131977 is a prime.
It is a super-2 number, since 2×1023211322332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102321132199 and 102321132208.
It is not a weakly prime, because it can be changed into another prime (102321132239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51160566116 + 51160566117.
It is an arithmetic number, because the mean of its divisors is an integer number (51160566117).
Almost surely, 2102321132233 is an apocalyptic number.
It is an amenable number.
102321132233 is a deficient number, since it is larger than the sum of its proper divisors (1).
102321132233 is an equidigital number, since it uses as much as digits as its factorization.
102321132233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 102321132233 its reverse (332231123201), we get a palindrome (434552255434).
The spelling of 102321132233 in words is "one hundred two billion, three hundred twenty-one million, one hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •