Base | Representation |
---|---|
bin | 1011000010110100010100… |
… | …0100110001010010000011 |
3 | 1120222212021201221021200110 |
4 | 2300231011010301102003 |
5 | 3042422412021033011 |
6 | 41454233121522403 |
7 | 2362206432034026 |
oct | 260550504612203 |
9 | 46885251837613 |
10 | 12143031424131 |
11 | 3961915741843 |
12 | 14414987a3403 |
13 | 6a111031936a |
14 | 2dda23a731bd |
15 | 160d04d41ba6 |
hex | b0b45131483 |
12143031424131 has 16 divisors (see below), whose sum is σ = 16713421319168. Its totient is φ = 7834011400800.
The previous prime is 12143031424081. The next prime is 12143031424151. The reversal of 12143031424131 is 13142413034121.
It is not a de Polignac number, because 12143031424131 - 29 = 12143031423619 is a prime.
It is a super-2 number, since 2×121430314241312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12143031424151) 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 15 ways as a sum of consecutive naturals, for example, 1974336 + ... + 5308866.
It is an arithmetic number, because the mean of its divisors is an integer number (1044588832448).
Almost surely, 212143031424131 is an apocalyptic number.
12143031424131 is a deficient number, since it is larger than the sum of its proper divisors (4570389895037).
12143031424131 is a wasteful number, since it uses less digits than its factorization.
12143031424131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3373722.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 12143031424131 its reverse (13142413034121), we get a palindrome (25285444458252).
The spelling of 12143031424131 in words is "twelve trillion, one hundred forty-three billion, thirty-one million, four hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •