Base | Representation |
---|---|
bin | 10111011011000110… |
… | …01011001000010011 |
3 | 1012110101202020121010 |
4 | 23231203023020103 |
5 | 201223242333121 |
6 | 5435501302003 |
7 | 623425520523 |
oct | 135543131023 |
9 | 35411666533 |
10 | 12575355411 |
11 | 5373507713 |
12 | 252b564903 |
13 | 1255411c08 |
14 | 8741cb683 |
15 | 4d9021376 |
hex | 2ed8cb213 |
12575355411 has 16 divisors (see below), whose sum is σ = 16804400000. Its totient is φ = 8364964608.
The previous prime is 12575355389. The next prime is 12575355433. The reversal of 12575355411 is 11455357521.
12575355411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12575355389) and next prime (12575355433).
It is not a de Polignac number, because 12575355411 - 210 = 12575354387 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12575355411.
It is not an unprimeable number, because it can be changed into a prime (12575355511) 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, 3216720 + ... + 3220626.
It is an arithmetic number, because the mean of its divisors is an integer number (1050275000).
Almost surely, 212575355411 is an apocalyptic number.
12575355411 is a deficient number, since it is larger than the sum of its proper divisors (4229044589).
12575355411 is a wasteful number, since it uses less digits than its factorization.
12575355411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6018.
The product of its digits is 105000, while the sum is 39.
The spelling of 12575355411 in words is "twelve billion, five hundred seventy-five million, three hundred fifty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •