Base | Representation |
---|---|
bin | 10110011011101000… |
… | …11001111001001101 |
3 | 1011002022000212012200 |
4 | 23031310121321031 |
5 | 144131002021141 |
6 | 5311003152113 |
7 | 604302552213 |
oct | 131564317115 |
9 | 34068025180 |
10 | 12043001421 |
11 | 511aa62240 |
12 | 2401215639 |
13 | 119c03c559 |
14 | 823612cb3 |
15 | 4a7416ab6 |
hex | 2cdd19e4d |
12043001421 has 12 divisors (see below), whose sum is σ = 18976850880. Its totient is φ = 7298788680.
The previous prime is 12043001417. The next prime is 12043001461. The reversal of 12043001421 is 12410034021.
It is not a de Polignac number, because 12043001421 - 22 = 12043001417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12043001394 and 12043001403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12043001461) 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 11 ways as a sum of consecutive naturals, for example, 60823141 + ... + 60823338.
It is an arithmetic number, because the mean of its divisors is an integer number (1581404240).
Almost surely, 212043001421 is an apocalyptic number.
12043001421 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12043001421 is a deficient number, since it is larger than the sum of its proper divisors (6933849459).
12043001421 is a wasteful number, since it uses less digits than its factorization.
12043001421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121646496 (or 121646493 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 12043001421 its reverse (12410034021), we get a palindrome (24453035442).
The spelling of 12043001421 in words is "twelve billion, forty-three million, one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •