Base | Representation |
---|---|
bin | 10111001001010101… |
… | …01011011100001111 |
3 | 1012002000022212011211 |
4 | 23210222223130033 |
5 | 200422114442243 |
6 | 5413015155251 |
7 | 616636021000 |
oct | 134452533417 |
9 | 35060285154 |
10 | 12426327823 |
11 | 52a737a018 |
12 | 24a9675b27 |
13 | 1230593800 |
14 | 85c4b71a7 |
15 | 4cadd4d9d |
hex | 2e4aab70f |
12426327823 has 36 divisors (see below), whose sum is σ = 15725775600. Its totient is φ = 9810584784.
The previous prime is 12426327811. The next prime is 12426327853. The reversal of 12426327823 is 32872362421.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is not a de Polignac number, because 12426327823 - 225 = 12392773391 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12426327853) 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 35 ways as a sum of consecutive naturals, for example, 26838490 + ... + 26838952.
It is an arithmetic number, because the mean of its divisors is an integer number (436827100).
Almost surely, 212426327823 is an apocalyptic number.
12426327823 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12426327823 is a deficient number, since it is larger than the sum of its proper divisors (3299447777).
12426327823 is an frugal number, since it uses more digits than its factorization.
12426327823 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 973 (or 483 counting only the distinct ones).
The product of its digits is 193536, while the sum is 40.
The spelling of 12426327823 in words is "twelve billion, four hundred twenty-six million, three hundred twenty-seven thousand, eight hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •