Base | Representation |
---|---|
bin | 10110011000000100… |
… | …00111101011111111 |
3 | 1011000012122210012110 |
4 | 23030002013223333 |
5 | 144100314324211 |
6 | 5304013105103 |
7 | 603460114215 |
oct | 131402075377 |
9 | 34005583173 |
10 | 12013042431 |
11 | 510505a645 |
12 | 23b3188193 |
13 | 1195a80140 |
14 | 81d654cb5 |
15 | 4a4999ea6 |
hex | 2cc087aff |
12013042431 has 8 divisors (see below), whose sum is σ = 17249496880. Its totient is φ = 7392641472.
The previous prime is 12013042421. The next prime is 12013042471. The reversal of 12013042431 is 13424031021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12013042431 - 210 = 12013041407 is a prime.
It is a super-2 number, since 2×120130424312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12013042398 and 12013042407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12013042421) 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 7 ways as a sum of consecutive naturals, for example, 154013326 + ... + 154013403.
It is an arithmetic number, because the mean of its divisors is an integer number (2156187110).
Almost surely, 212013042431 is an apocalyptic number.
12013042431 is a deficient number, since it is larger than the sum of its proper divisors (5236454449).
12013042431 is a wasteful number, since it uses less digits than its factorization.
12013042431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308026745.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12013042431 its reverse (13424031021), we get a palindrome (25437073452).
The spelling of 12013042431 in words is "twelve billion, thirteen million, forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •