Base | Representation |
---|---|
bin | 10000000011100011101… |
… | …101101001000000001001 |
3 | 10220110220002211221012112 |
4 | 100003203231221000021 |
5 | 121034110444121413 |
6 | 2202510322152105 |
7 | 142466411301152 |
oct | 20034355510011 |
9 | 3813802757175 |
10 | 1103332020233 |
11 | 395a14186123 |
12 | 1599bb7b2635 |
13 | 800751bbc91 |
14 | 3b589c1a929 |
15 | 1da7827b2a8 |
hex | 100e3b69009 |
1103332020233 has 2 divisors, whose sum is σ = 1103332020234. Its totient is φ = 1103332020232.
The previous prime is 1103332020121. The next prime is 1103332020253. The reversal of 1103332020233 is 3320202333011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1030848304249 + 72483715984 = 1015307^2 + 269228^2 .
It is a cyclic number.
It is not a de Polignac number, because 1103332020233 - 230 = 1102258278409 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1103332020199 and 1103332020208.
It is not a weakly prime, because it can be changed into another prime (1103332020253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551666010116 + 551666010117.
It is an arithmetic number, because the mean of its divisors is an integer number (551666010117).
Almost surely, 21103332020233 is an apocalyptic number.
It is an amenable number.
1103332020233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103332020233 is an equidigital number, since it uses as much as digits as its factorization.
1103332020233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 1103332020233 its reverse (3320202333011), we get a palindrome (4423534353244).
The spelling of 1103332020233 in words is "one trillion, one hundred three billion, three hundred thirty-two million, twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •