Base | Representation |
---|---|
bin | 10000000101101000001… |
… | …010001101011011011111 |
3 | 10220200121222002101022121 |
4 | 100011220022031123133 |
5 | 121103133322230413 |
6 | 2203515021123411 |
7 | 142605442546462 |
oct | 20055012153337 |
9 | 3820558071277 |
10 | 1105554101983 |
11 | 396954518021 |
12 | 15a31b9b9567 |
13 | 8033a682456 |
14 | 3b71ada52d9 |
15 | 1db583aab8d |
hex | 1016828d6df |
1105554101983 has 2 divisors, whose sum is σ = 1105554101984. Its totient is φ = 1105554101982.
The previous prime is 1105554101923. The next prime is 1105554102001. The reversal of 1105554101983 is 3891014555011.
It is a strong prime.
It is an emirp because it is prime and its reverse (3891014555011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1105554101983 - 29 = 1105554101471 is a prime.
It is a super-2 number, since 2×11055541019832 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105554101923) 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, 552777050991 + 552777050992.
It is an arithmetic number, because the mean of its divisors is an integer number (552777050992).
Almost surely, 21105554101983 is an apocalyptic number.
1105554101983 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105554101983 is an equidigital number, since it uses as much as digits as its factorization.
1105554101983 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 43.
Adding to 1105554101983 its reverse (3891014555011), we get a palindrome (4996568656994).
The spelling of 1105554101983 in words is "one trillion, one hundred five billion, five hundred fifty-four million, one hundred one thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •