Base | Representation |
---|---|
bin | 11000101101111111… |
… | …10000011100000001 |
3 | 1021020212012010102010 |
4 | 30112333300130001 |
5 | 204134300322423 |
6 | 10032501243133 |
7 | 646601131416 |
oct | 142677603401 |
9 | 37225163363 |
10 | 13270714113 |
11 | 569aa76a28 |
12 | 26a44034a9 |
13 | 13364b7877 |
14 | 8dc6b810d |
15 | 52a0c8693 |
hex | 316ff0701 |
13270714113 has 8 divisors (see below), whose sum is σ = 18172509568. Its totient is φ = 8608030704.
The previous prime is 13270714049. The next prime is 13270714129. The reversal of 13270714113 is 31141707231.
13270714113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13270714113 - 26 = 13270714049 is a prime.
It is a super-2 number, since 2×132707141132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13270714153) 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 7 ways as a sum of consecutive naturals, for example, 59777881 + ... + 59778102.
It is an arithmetic number, because the mean of its divisors is an integer number (2271563696).
Almost surely, 213270714113 is an apocalyptic number.
It is an amenable number.
13270714113 is a deficient number, since it is larger than the sum of its proper divisors (4901795455).
13270714113 is a wasteful number, since it uses less digits than its factorization.
13270714113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119556023.
The product of its (nonzero) digits is 3528, while the sum is 30.
The spelling of 13270714113 in words is "thirteen billion, two hundred seventy million, seven hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •