Base | Representation |
---|---|
bin | 10000000011100011001… |
… | …100000010010101101001 |
3 | 10220110212111021101100211 |
4 | 100003203030002111221 |
5 | 121034101220223423 |
6 | 2202505405301121 |
7 | 142466243361454 |
oct | 20034314022551 |
9 | 3813774241324 |
10 | 1103323211113 |
11 | 395a0a209762 |
12 | 1599b88647a1 |
13 | 80073426496 |
14 | 3b5889a649b |
15 | 1da775db10d |
hex | 100e3302569 |
1103323211113 has 2 divisors, whose sum is σ = 1103323211114. Its totient is φ = 1103323211112.
The previous prime is 1103323211099. The next prime is 1103323211117. The reversal of 1103323211113 is 3111123233011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1090412115984 + 12911095129 = 1044228^2 + 113627^2 .
It is a cyclic number.
It is not a de Polignac number, because 1103323211113 - 233 = 1094733276521 is a prime.
It is not a weakly prime, because it can be changed into another prime (1103323211117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551661605556 + 551661605557.
It is an arithmetic number, because the mean of its divisors is an integer number (551661605557).
Almost surely, 21103323211113 is an apocalyptic number.
It is an amenable number.
1103323211113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103323211113 is an equidigital number, since it uses as much as digits as its factorization.
1103323211113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1103323211113 its reverse (3111123233011), we get a palindrome (4214446444124).
The spelling of 1103323211113 in words is "one trillion, one hundred three billion, three hundred twenty-three million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •