Base | Representation |
---|---|
bin | 11000011010111101… |
… | …01110100110110001 |
3 | 1020211201202220101122 |
4 | 30031132232212301 |
5 | 203322412422123 |
6 | 10004555312025 |
7 | 642622115246 |
oct | 141536564661 |
9 | 36751686348 |
10 | 13111060913 |
11 | 5618941135 |
12 | 265aa4b615 |
13 | 130c3b8c12 |
14 | 8c53d95cd |
15 | 51b08dbc8 |
hex | 30d7ae9b1 |
13111060913 has 4 divisors (see below), whose sum is σ = 13134600180. Its totient is φ = 13087521648.
The previous prime is 13111060891. The next prime is 13111060939. The reversal of 13111060913 is 31906011131.
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 1127817889 + 11983243024 = 33583^2 + 109468^2 .
It is a cyclic number.
It is not a de Polignac number, because 13111060913 - 26 = 13111060849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13111060993) 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 in 3 ways as a sum of consecutive naturals, for example, 11768798 + ... + 11769911.
It is an arithmetic number, because the mean of its divisors is an integer number (3283650045).
Almost surely, 213111060913 is an apocalyptic number.
It is an amenable number.
13111060913 is a deficient number, since it is larger than the sum of its proper divisors (23539267).
13111060913 is an equidigital number, since it uses as much as digits as its factorization.
13111060913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23539266.
The product of its (nonzero) digits is 486, while the sum is 26.
The spelling of 13111060913 in words is "thirteen billion, one hundred eleven million, sixty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •