Base | Representation |
---|---|
bin | 11000011111001110… |
… | …10011101000000011 |
3 | 1020221020010220011202 |
4 | 30033213103220003 |
5 | 203411044123011 |
6 | 10012314531415 |
7 | 643535333642 |
oct | 141747235003 |
9 | 36836126152 |
10 | 13146864131 |
11 | 5637075675 |
12 | 266aa36b6b |
13 | 131694345b |
14 | 8ca079359 |
15 | 51e2b223b |
hex | 30f9d3a03 |
13146864131 has 4 divisors (see below), whose sum is σ = 13214982792. Its totient is φ = 13078745472.
The previous prime is 13146864113. The next prime is 13146864139.
It is a happy number.
13146864131 is nontrivially palindromic in base 10.
13146864131 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 is a cyclic number.
It is not a de Polignac number, because 13146864131 - 226 = 13079755267 is a prime.
It is a super-2 number, since 2×131468641312 (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 (13146864139) 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, 34059041 + ... + 34059426.
It is an arithmetic number, because the mean of its divisors is an integer number (3303745698).
Almost surely, 213146864131 is an apocalyptic number.
13146864131 is a deficient number, since it is larger than the sum of its proper divisors (68118661).
13146864131 is an equidigital number, since it uses as much as digits as its factorization.
13146864131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68118660.
The product of its digits is 41472, while the sum is 38.
The spelling of 13146864131 in words is "thirteen billion, one hundred forty-six million, eight hundred sixty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •