Base | Representation |
---|---|
bin | 1010000001000000000110… |
… | …0000000100101101000101 |
3 | 1102222202201121102012100102 |
4 | 2200100001200010231011 |
5 | 2420411213230111122 |
6 | 35230553544253445 |
7 | 2214420405604214 |
oct | 240200140045505 |
9 | 42882647365312 |
10 | 11012321332037 |
11 | 3566332335053 |
12 | 129a318171285 |
13 | 61b5c401517c |
14 | 2a0ddbb1b07b |
15 | 1416c824e492 |
hex | a0401804b45 |
11012321332037 has 2 divisors, whose sum is σ = 11012321332038. Its totient is φ = 11012321332036.
The previous prime is 11012321331967. The next prime is 11012321332069. The reversal of 11012321332037 is 73023312321011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9276952464481 + 1735368867556 = 3045809^2 + 1317334^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012321332037 - 234 = 10995141462853 is a prime.
It is a super-2 number, since 2×110123213320372 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11032321332037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506160666018 + 5506160666019.
It is an arithmetic number, because the mean of its divisors is an integer number (5506160666019).
Almost surely, 211012321332037 is an apocalyptic number.
It is an amenable number.
11012321332037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012321332037 is an equidigital number, since it uses as much as digits as its factorization.
11012321332037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 29.
Adding to 11012321332037 its reverse (73023312321011), we get a palindrome (84035633653048).
The spelling of 11012321332037 in words is "eleven trillion, twelve billion, three hundred twenty-one million, three hundred thirty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •