Base | Representation |
---|---|
bin | 1010000000111111011100… |
… | …0100100111110011011001 |
3 | 1102222202021102011212210021 |
4 | 2200033313010213303121 |
5 | 2420410333432113414 |
6 | 35230524334150441 |
7 | 2214413152443166 |
oct | 240176704476331 |
9 | 42882242155707 |
10 | 11012146363609 |
11 | 3566252599746 |
12 | 129a289652421 |
13 | 61b5969b3561 |
14 | 2a0dc27b306d |
15 | 1416b7bdbc24 |
hex | a03f7127cd9 |
11012146363609 has 2 divisors, whose sum is σ = 11012146363610. Its totient is φ = 11012146363608.
The previous prime is 11012146363591. The next prime is 11012146363627. The reversal of 11012146363609 is 90636364121011.
It is a balanced prime because it is at equal distance from previous prime (11012146363591) and next prime (11012146363627).
It can be written as a sum of positive squares in only one way, i.e., 9110497089600 + 1901649274009 = 3018360^2 + 1379003^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012146363609 - 27 = 11012146363481 is a prime.
It is not a weakly prime, because it can be changed into another prime (11012146373609) 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 as a sum of consecutive naturals, namely, 5506073181804 + 5506073181805.
It is an arithmetic number, because the mean of its divisors is an integer number (5506073181805).
Almost surely, 211012146363609 is an apocalyptic number.
It is an amenable number.
11012146363609 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012146363609 is an equidigital number, since it uses as much as digits as its factorization.
11012146363609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 43.
The spelling of 11012146363609 in words is "eleven trillion, twelve billion, one hundred forty-six million, three hundred sixty-three thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •