Base | Representation |
---|---|
bin | 10100100001101101… |
… | …10110011000100111 |
3 | 1001110000111210122022 |
4 | 22100312312120213 |
5 | 140032134412411 |
6 | 5021305453355 |
7 | 540043266641 |
oct | 122066663047 |
9 | 31400453568 |
10 | 11020232231 |
11 | 47456a7648 |
12 | 21767a125b |
13 | 106818c698 |
14 | 767859891 |
15 | 447738edb |
hex | 290db6627 |
11020232231 has 2 divisors, whose sum is σ = 11020232232. Its totient is φ = 11020232230.
The previous prime is 11020232173. The next prime is 11020232239. The reversal of 11020232231 is 13223202011.
11020232231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (13223202011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11020232231 is a prime.
It is a super-2 number, since 2×110202322312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020232239) 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, 5510116115 + 5510116116.
It is an arithmetic number, because the mean of its divisors is an integer number (5510116116).
Almost surely, 211020232231 is an apocalyptic number.
11020232231 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020232231 is an equidigital number, since it uses as much as digits as its factorization.
11020232231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11020232231 its reverse (13223202011), we get a palindrome (24243434242).
The spelling of 11020232231 in words is "eleven billion, twenty million, two hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •