Base | Representation |
---|---|
bin | 10100100001111101… |
… | …10100101001111101 |
3 | 1001110011102222200022 |
4 | 22100332310221331 |
5 | 140033203303201 |
6 | 5021422341525 |
7 | 540100123304 |
oct | 122076645175 |
9 | 31404388608 |
10 | 11022322301 |
11 | 47468a4981 |
12 | 217742a8a5 |
13 | 1068741b03 |
14 | 767c4143b |
15 | 4479ed41b |
hex | 290fb4a7d |
11022322301 has 2 divisors, whose sum is σ = 11022322302. Its totient is φ = 11022322300.
The previous prime is 11022322279. The next prime is 11022322309. The reversal of 11022322301 is 10322322011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8118190201 + 2904132100 = 90101^2 + 53890^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022322301 - 218 = 11022060157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11022322301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022322309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511161150 + 5511161151.
It is an arithmetic number, because the mean of its divisors is an integer number (5511161151).
Almost surely, 211022322301 is an apocalyptic number.
It is an amenable number.
11022322301 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022322301 is an equidigital number, since it uses as much as digits as its factorization.
11022322301 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 11022322301 its reverse (10322322011), we get a palindrome (21344644312).
The spelling of 11022322301 in words is "eleven billion, twenty-two million, three hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •