Base | Representation |
---|---|
bin | 11000110010001101… |
… | …10010010100011111 |
3 | 1021100022210111011200 |
4 | 30121012302110133 |
5 | 204222331030023 |
6 | 10040204050543 |
7 | 650511036204 |
oct | 143106622437 |
9 | 37308714150 |
10 | 13306111263 |
11 | 5708a53375 |
12 | 26b4233a53 |
13 | 134092c323 |
14 | 90328dcab |
15 | 52d26b743 |
hex | 3191b251f |
13306111263 has 12 divisors (see below), whose sum is σ = 19287857160. Its totient is φ = 8839393776.
The previous prime is 13306111211. The next prime is 13306111283. The reversal of 13306111263 is 36211160331.
13306111263 is a `hidden beast` number, since 1 + 3 + 30 + 611 + 12 + 6 + 3 = 666.
13306111263 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13306111263 - 212 = 13306107167 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13306111283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2609568 + ... + 2614661.
It is an arithmetic number, because the mean of its divisors is an integer number (1607321430).
Almost surely, 213306111263 is an apocalyptic number.
13306111263 is a deficient number, since it is larger than the sum of its proper divisors (5981745897).
13306111263 is a wasteful number, since it uses less digits than its factorization.
13306111263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5224518 (or 5224515 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
Adding to 13306111263 its reverse (36211160331), we get a palindrome (49517271594).
The spelling of 13306111263 in words is "thirteen billion, three hundred six million, one hundred eleven thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •