Base | Representation |
---|---|
bin | 11000011101111111… |
… | …01000010100011011 |
3 | 1020220111120110200112 |
4 | 30032333220110123 |
5 | 203400413310011 |
6 | 10011303554535 |
7 | 643351044221 |
oct | 141677502433 |
9 | 36814513615 |
10 | 13136463131 |
11 | 5631211200 |
12 | 266745ba4b |
13 | 131474120c |
14 | 8c892cb11 |
15 | 51d40a58b |
hex | 30efe851b |
13136463131 has 24 divisors (see below), whose sum is σ = 14686264320. Its totient is φ = 11739665520.
The previous prime is 13136463121. The next prime is 13136463139.
13136463131 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13136463131 - 222 = 13132268827 is a prime.
It is a super-2 number, since 2×131364631312 (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 (13136463139) 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 23 ways as a sum of consecutive naturals, for example, 1728566 + ... + 1736148.
It is an arithmetic number, because the mean of its divisors is an integer number (611927680).
Almost surely, 213136463131 is an apocalyptic number.
13136463131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13136463131 is a deficient number, since it is larger than the sum of its proper divisors (1549801189).
13136463131 is a wasteful number, since it uses less digits than its factorization.
13136463131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7847 (or 7836 counting only the distinct ones).
The product of its digits is 11664, while the sum is 32.
The spelling of 13136463131 in words is "thirteen billion, one hundred thirty-six million, four hundred sixty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •