Base | Representation |
---|---|
bin | 11000110001011111… |
… | …11001011111001101 |
3 | 1021022220111122210011 |
4 | 30120233321133031 |
5 | 204214312030214 |
6 | 10035431313221 |
7 | 650406036502 |
oct | 143057713715 |
9 | 37286448704 |
10 | 13300111309 |
11 | 5705625531 |
12 | 26b221b811 |
13 | 133c60b364 |
14 | 90256b4a9 |
15 | 52c983ac4 |
hex | 318bf97cd |
13300111309 has 4 divisors (see below), whose sum is σ = 13309021116. Its totient is φ = 13291201504.
The previous prime is 13300111303. The next prime is 13300111339. The reversal of 13300111309 is 90311100331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11325642084 + 1974469225 = 106422^2 + 44435^2 .
It is a cyclic number.
It is not a de Polignac number, because 13300111309 - 29 = 13300110797 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13300111309.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13300111303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4452664 + ... + 4455649.
It is an arithmetic number, because the mean of its divisors is an integer number (3327255279).
Almost surely, 213300111309 is an apocalyptic number.
It is an amenable number.
13300111309 is a deficient number, since it is larger than the sum of its proper divisors (8909807).
13300111309 is an equidigital number, since it uses as much as digits as its factorization.
13300111309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8909806.
The product of its (nonzero) digits is 243, while the sum is 22.
It can be divided in two parts, 13300 and 111309, that added together give a square (124609 = 3532).
The spelling of 13300111309 in words is "thirteen billion, three hundred million, one hundred eleven thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •