Base | Representation |
---|---|
bin | 110000000100010011… |
… | …0111111110001101101 |
3 | 100212102211112000022002 |
4 | 1200020212333301231 |
5 | 3142400223434113 |
6 | 115230441102045 |
7 | 10312656411065 |
oct | 1401046776155 |
9 | 325384460262 |
10 | 103223655533 |
11 | 3a860076229 |
12 | 18009487925 |
13 | 997064151b |
14 | 4dd32463a5 |
15 | 2a4225bc58 |
hex | 18089bfc6d |
103223655533 has 2 divisors, whose sum is σ = 103223655534. Its totient is φ = 103223655532.
The previous prime is 103223655433. The next prime is 103223655551. The reversal of 103223655533 is 335556322301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78490746244 + 24732909289 = 280162^2 + 157267^2 .
It is an emirp because it is prime and its reverse (335556322301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103223655533 - 212 = 103223651437 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103223655433) 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, 51611827766 + 51611827767.
It is an arithmetic number, because the mean of its divisors is an integer number (51611827767).
Almost surely, 2103223655533 is an apocalyptic number.
It is an amenable number.
103223655533 is a deficient number, since it is larger than the sum of its proper divisors (1).
103223655533 is an equidigital number, since it uses as much as digits as its factorization.
103223655533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243000, while the sum is 38.
Adding to 103223655533 its reverse (335556322301), we get a palindrome (438779977834).
The spelling of 103223655533 in words is "one hundred three billion, two hundred twenty-three million, six hundred fifty-five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •