Base | Representation |
---|---|
bin | 1011010011001100100100… |
… | …1101010010001111001111 |
3 | 1121222202121021022001200011 |
4 | 2310303021031102033033 |
5 | 3112030203301414043 |
6 | 42231411131414051 |
7 | 2421430511022640 |
oct | 264631115221717 |
9 | 47882537261604 |
10 | 12424421123023 |
11 | 3a601929023a8 |
12 | 1487b295b4327 |
13 | 6c1805653180 |
14 | 30d4b92bd6c7 |
15 | 1682c379259d |
hex | b4cc93523cf |
12424421123023 has 32 divisors (see below), whose sum is σ = 15858341573760. Its totient is φ = 9467664998400.
The previous prime is 12424421122987. The next prime is 12424421123027. The reversal of 12424421123023 is 32032112442421.
It is not a de Polignac number, because 12424421123023 - 217 = 12424420991951 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12424421123027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4812090 + ... + 6928567.
It is an arithmetic number, because the mean of its divisors is an integer number (495573174180).
Almost surely, 212424421123023 is an apocalyptic number.
12424421123023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12424421123023 is a deficient number, since it is larger than the sum of its proper divisors (3433920450737).
12424421123023 is a wasteful number, since it uses less digits than its factorization.
12424421123023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11741107.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 12424421123023 its reverse (32032112442421), we get a palindrome (44456533565444).
The spelling of 12424421123023 in words is "twelve trillion, four hundred twenty-four billion, four hundred twenty-one million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •