Base | Representation |
---|---|
bin | 1010000010001010010000… |
… | …1110010100011000110101 |
3 | 1110001200010011101222001122 |
4 | 2200202210032110120311 |
5 | 2421223002143424302 |
6 | 35244045334433325 |
7 | 2216023655144015 |
oct | 240424416243065 |
9 | 43050104358048 |
10 | 11032231233077 |
11 | 3573819a1541a |
12 | 12a2153b02845 |
13 | 620447b34ac2 |
14 | 2a1d6a06bc45 |
15 | 141e9111e3a2 |
hex | a08a4394635 |
11032231233077 has 2 divisors, whose sum is σ = 11032231233078. Its totient is φ = 11032231233076.
The previous prime is 11032231232993. The next prime is 11032231233097. The reversal of 11032231233077 is 77033213223011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7474805212081 + 3557426020996 = 2734009^2 + 1886114^2 .
It is a cyclic number.
It is not a de Polignac number, because 11032231233077 - 224 = 11032214455861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11032231233097) 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 as a sum of consecutive naturals, namely, 5516115616538 + 5516115616539.
It is an arithmetic number, because the mean of its divisors is an integer number (5516115616539).
Almost surely, 211032231233077 is an apocalyptic number.
It is an amenable number.
11032231233077 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032231233077 is an equidigital number, since it uses as much as digits as its factorization.
11032231233077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31752, while the sum is 35.
Adding to 11032231233077 its reverse (77033213223011), we get a palindrome (88065444456088).
The spelling of 11032231233077 in words is "eleven trillion, thirty-two billion, two hundred thirty-one million, two hundred thirty-three thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.241 sec. • engine limits •