Base | Representation |
---|---|
bin | 10110100110001011… |
… | …10000001001111011 |
3 | 1011022110102202110021 |
4 | 23103011300021323 |
5 | 144321121411011 |
6 | 5323442431311 |
7 | 606425332354 |
oct | 132305601173 |
9 | 34273382407 |
10 | 12131435131 |
11 | 5165973852 |
12 | 2426962537 |
13 | 11b44635aa |
14 | 831272d2b |
15 | 4b0084471 |
hex | 2d317027b |
12131435131 has 2 divisors, whose sum is σ = 12131435132. Its totient is φ = 12131435130.
The previous prime is 12131435111. The next prime is 12131435167. The reversal of 12131435131 is 13153413121.
12131435131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12131435131 is a prime.
It is a super-2 number, since 2×121314351312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12131435096 and 12131435105.
It is not a weakly prime, because it can be changed into another prime (12131435111) 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 as a sum of consecutive naturals, namely, 6065717565 + 6065717566.
It is an arithmetic number, because the mean of its divisors is an integer number (6065717566).
Almost surely, 212131435131 is an apocalyptic number.
12131435131 is a deficient number, since it is larger than the sum of its proper divisors (1).
12131435131 is an equidigital number, since it uses as much as digits as its factorization.
12131435131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1080, while the sum is 25.
Adding to 12131435131 its reverse (13153413121), we get a palindrome (25284848252).
The spelling of 12131435131 in words is "twelve billion, one hundred thirty-one million, four hundred thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •