Base | Representation |
---|---|
bin | 1010000001000011010111… |
… | …1100001000000111001111 |
3 | 1102222211222220212002211211 |
4 | 2200100311330020013033 |
5 | 2420420013440220023 |
6 | 35231221132555251 |
7 | 2214451250533114 |
oct | 240206574100717 |
9 | 42884886762754 |
10 | 11013201101263 |
11 | 35667439a9759 |
12 | 129a522922b27 |
13 | 61b70437738a |
14 | 2a10828cc90b |
15 | 14172a5d1a0d |
hex | a0435f081cf |
11013201101263 has 2 divisors, whose sum is σ = 11013201101264. Its totient is φ = 11013201101262.
The previous prime is 11013201101207. The next prime is 11013201101341. The reversal of 11013201101263 is 36210110231011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11013201101263 - 29 = 11013201100751 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11013201101663) 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, 5506600550631 + 5506600550632.
It is an arithmetic number, because the mean of its divisors is an integer number (5506600550632).
Almost surely, 211013201101263 is an apocalyptic number.
11013201101263 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013201101263 is an equidigital number, since it uses as much as digits as its factorization.
11013201101263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11013201101263 its reverse (36210110231011), we get a palindrome (47223311332274).
The spelling of 11013201101263 in words is "eleven trillion, thirteen billion, two hundred one million, one hundred one thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •