Base | Representation |
---|---|
bin | 10000000011110000111… |
… | …101011011000101010011 |
3 | 10220111110121000221200022 |
4 | 100003300331123011103 |
5 | 121040034342330311 |
6 | 2202544341414055 |
7 | 142505050310324 |
oct | 20036075330523 |
9 | 3814417027608 |
10 | 1103554261331 |
11 | 39601867a155 |
12 | 159a6210a32b |
13 | 800ac2627a2 |
14 | 3b5ab54c44b |
15 | 1da8ca2a5db |
hex | 100f0f5b153 |
1103554261331 has 2 divisors, whose sum is σ = 1103554261332. Its totient is φ = 1103554261330.
The previous prime is 1103554261319. The next prime is 1103554261343. The reversal of 1103554261331 is 1331624553011.
It is a balanced prime because it is at equal distance from previous prime (1103554261319) and next prime (1103554261343).
It is a cyclic number.
It is not a de Polignac number, because 1103554261331 - 222 = 1103550067027 is a prime.
It is a super-2 number, since 2×11035542613312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1103554261291 and 1103554261300.
It is not a weakly prime, because it can be changed into another prime (1103554267331) 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, 551777130665 + 551777130666.
It is an arithmetic number, because the mean of its divisors is an integer number (551777130666).
Almost surely, 21103554261331 is an apocalyptic number.
1103554261331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103554261331 is an equidigital number, since it uses as much as digits as its factorization.
1103554261331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 1103554261331 in words is "one trillion, one hundred three billion, five hundred fifty-four million, two hundred sixty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •