Base | Representation |
---|---|
bin | 10110100111100101… |
… | …01000101101101011 |
3 | 1011100021120112101001 |
4 | 23103302220231223 |
5 | 144332124414011 |
6 | 5324542535431 |
7 | 606630335515 |
oct | 132362505553 |
9 | 34307515331 |
10 | 12143201131 |
11 | 517157a816 |
12 | 242a897577 |
13 | 11b6a22c19 |
14 | 832a56bb5 |
15 | 4b110a7c1 |
hex | 2d3ca8b6b |
12143201131 has 16 divisors (see below), whose sum is σ = 13008889600. Its totient is φ = 11300666400.
The previous prime is 12143201111. The next prime is 12143201137. The reversal of 12143201131 is 13110234121.
It is a cyclic number.
It is not a de Polignac number, because 12143201131 - 215 = 12143168363 is a prime.
It is a super-2 number, since 2×121432011312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 12143201099 and 12143201108.
It is not an unprimeable number, because it can be changed into a prime (12143201137) 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 15 ways as a sum of consecutive naturals, for example, 933490 + ... + 946408.
It is an arithmetic number, because the mean of its divisors is an integer number (813055600).
Almost surely, 212143201131 is an apocalyptic number.
12143201131 is a deficient number, since it is larger than the sum of its proper divisors (865688469).
12143201131 is a wasteful number, since it uses less digits than its factorization.
12143201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13810.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12143201131 its reverse (13110234121), we get a palindrome (25253435252).
The spelling of 12143201131 in words is "twelve billion, one hundred forty-three million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •