Base | Representation |
---|---|
bin | 10111001011111100… |
… | …10011110000000001 |
3 | 1012010112120122221221 |
4 | 23211332103300001 |
5 | 200443223012011 |
6 | 5415121115041 |
7 | 620323246423 |
oct | 134576236001 |
9 | 35115518857 |
10 | 12448250881 |
11 | 5308793150 |
12 | 24b4a88a81 |
13 | 1234c9b331 |
14 | 861382813 |
15 | 4cccb5971 |
hex | 2e5f93c01 |
12448250881 has 16 divisors (see below), whose sum is σ = 14680992960. Its totient is φ = 10431218880.
The previous prime is 12448250839. The next prime is 12448250887. The reversal of 12448250881 is 18805284421.
12448250881 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12448250881 - 217 = 12448119809 is a prime.
It is a super-2 number, since 2×124482508812 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12448250887) 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, 797146 + ... + 812611.
It is an arithmetic number, because the mean of its divisors is an integer number (917562060).
Almost surely, 212448250881 is an apocalyptic number.
12448250881 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12448250881 is a deficient number, since it is larger than the sum of its proper divisors (2232742079).
12448250881 is a wasteful number, since it uses less digits than its factorization.
12448250881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1609824.
The product of its (nonzero) digits is 163840, while the sum is 43.
The spelling of 12448250881 in words is "twelve billion, four hundred forty-eight million, two hundred fifty thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •