Base | Representation |
---|---|
bin | 10000000100011111010… |
… | …100010110000111001001 |
3 | 10220120110210112022001001 |
4 | 100010133110112013021 |
5 | 121043132444202332 |
6 | 2203153443455001 |
7 | 142533243210634 |
oct | 20043724260711 |
9 | 3816423468031 |
10 | 1104332022217 |
11 | 396387700446 |
12 | 15a03a687461 |
13 | 801a442a028 |
14 | 3b642968c1b |
15 | 1dad5e5d0e7 |
hex | 1011f5161c9 |
1104332022217 has 2 divisors, whose sum is σ = 1104332022218. Its totient is φ = 1104332022216.
The previous prime is 1104332022187. The next prime is 1104332022289. The reversal of 1104332022217 is 7122202334011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 747306651961 + 357025370256 = 864469^2 + 597516^2 .
It is an emirp because it is prime and its reverse (7122202334011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1104332022217 - 231 = 1102184538569 is a prime.
It is not a weakly prime, because it can be changed into another prime (1104332022317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552166011108 + 552166011109.
It is an arithmetic number, because the mean of its divisors is an integer number (552166011109).
Almost surely, 21104332022217 is an apocalyptic number.
It is an amenable number.
1104332022217 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104332022217 is an equidigital number, since it uses as much as digits as its factorization.
1104332022217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 28.
Adding to 1104332022217 its reverse (7122202334011), we get a palindrome (8226534356228).
The spelling of 1104332022217 in words is "one trillion, one hundred four billion, three hundred thirty-two million, twenty-two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •