Base | Representation |
---|---|
bin | 1010000000111111010110… |
… | …1001101111101001000101 |
3 | 1102222202012202100112210002 |
4 | 2200033311221233221011 |
5 | 2420410311332244423 |
6 | 35230522123411045 |
7 | 2214412443112325 |
oct | 240176551575105 |
9 | 42882182315702 |
10 | 11012122540613 |
11 | 35662400a8117 |
12 | 129a281683a85 |
13 | 61b591a91ccc |
14 | 2a0dbd571285 |
15 | 1416b5a83228 |
hex | a03f5a6fa45 |
11012122540613 has 2 divisors, whose sum is σ = 11012122540614. Its totient is φ = 11012122540612.
The previous prime is 11012122540579. The next prime is 11012122540619. The reversal of 11012122540613 is 31604522121011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10444899668449 + 567222872164 = 3231857^2 + 753142^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012122540613 - 212 = 11012122536517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012122540619) 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, 5506061270306 + 5506061270307.
It is an arithmetic number, because the mean of its divisors is an integer number (5506061270307).
Almost surely, 211012122540613 is an apocalyptic number.
It is an amenable number.
11012122540613 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012122540613 is an equidigital number, since it uses as much as digits as its factorization.
11012122540613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 11012122540613 its reverse (31604522121011), we get a palindrome (42616644661624).
The spelling of 11012122540613 in words is "eleven trillion, twelve billion, one hundred twenty-two million, five hundred forty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •