Base | Representation |
---|---|
bin | 11000010100010001… |
… | …11010100111101101 |
3 | 1020200211022021210101 |
4 | 30022020322213231 |
5 | 203214040330214 |
6 | 5555234111101 |
7 | 641341523314 |
oct | 141210724755 |
9 | 36624267711 |
10 | 13055011309 |
11 | 559a23924a |
12 | 264411b491 |
13 | 13008c3082 |
14 | 8bbba927b |
15 | 5161bb774 |
hex | 30a23a9ed |
13055011309 has 4 divisors (see below), whose sum is σ = 13057097404. Its totient is φ = 13052925216.
The previous prime is 13055011279. The next prime is 13055011313. The reversal of 13055011309 is 90311055031.
13055011309 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10853055684 + 2201955625 = 104178^2 + 46925^2 .
It is a cyclic number.
It is not a de Polignac number, because 13055011309 - 27 = 13055011181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13055011009) 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 3 ways as a sum of consecutive naturals, for example, 1033632 + ... + 1046185.
It is an arithmetic number, because the mean of its divisors is an integer number (3264274351).
Almost surely, 213055011309 is an apocalyptic number.
It is an amenable number.
13055011309 is a deficient number, since it is larger than the sum of its proper divisors (2086095).
13055011309 is an equidigital number, since it uses as much as digits as its factorization.
13055011309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2086094.
The product of its (nonzero) digits is 2025, while the sum is 28.
The spelling of 13055011309 in words is "thirteen billion, fifty-five million, eleven thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •