Base | Representation |
---|---|
bin | 10000000101010111110… |
… | …010101000000101100111 |
3 | 10220122220211100100121221 |
4 | 100011113302220011213 |
5 | 121102103021444023 |
6 | 2203431451121211 |
7 | 142565566413643 |
oct | 20052762500547 |
9 | 3818824310557 |
10 | 1105279484263 |
11 | 3968234aa729 |
12 | 15a263a43207 |
13 | 802c5800866 |
14 | 3b6d271bc23 |
15 | 1db3e21285d |
hex | 10157ca8167 |
1105279484263 has 2 divisors, whose sum is σ = 1105279484264. Its totient is φ = 1105279484262.
The previous prime is 1105279484261. The next prime is 1105279484293. The reversal of 1105279484263 is 3624849725011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1105279484263 - 21 = 1105279484261 is a prime.
It is a super-3 number, since 3×11052794842633 (a number of 37 digits) contains 333 as substring.
Together with 1105279484261, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1105279484263.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105279484261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552639742131 + 552639742132.
It is an arithmetic number, because the mean of its divisors is an integer number (552639742132).
It is a 1-persistent number, because it is pandigital, but 2⋅1105279484263 = 2210558968526 is not.
Almost surely, 21105279484263 is an apocalyptic number.
1105279484263 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105279484263 is an equidigital number, since it uses as much as digits as its factorization.
1105279484263 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2903040, while the sum is 52.
The spelling of 1105279484263 in words is "one trillion, one hundred five billion, two hundred seventy-nine million, four hundred eighty-four thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •