Base | Representation |
---|---|
bin | 10101000110111000… |
… | …01110111111000101 |
3 | 1002020202012101002102 |
4 | 22203130032333011 |
5 | 141201444202323 |
6 | 5112244321445 |
7 | 550550412431 |
oct | 124334167705 |
9 | 32222171072 |
10 | 11332022213 |
11 | 48956a4016 |
12 | 22430a3285 |
13 | 10b79579b5 |
14 | 79701b9c1 |
15 | 464cc6328 |
hex | 2a370efc5 |
11332022213 has 8 divisors (see below), whose sum is σ = 11546789208. Its totient is φ = 11118864384.
The previous prime is 11332022203. The next prime is 11332022239. The reversal of 11332022213 is 31222023311.
It can be written as a sum of positive squares in 4 ways, for example, as 2879610244 + 8452411969 = 53662^2 + 91937^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11332022213 - 28 = 11332021957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11332022203) 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 in 7 ways as a sum of consecutive naturals, for example, 388070 + ... + 416247.
It is an arithmetic number, because the mean of its divisors is an integer number (1443348651).
Almost surely, 211332022213 is an apocalyptic number.
It is an amenable number.
11332022213 is a deficient number, since it is larger than the sum of its proper divisors (214766995).
11332022213 is an equidigital number, since it uses as much as digits as its factorization.
11332022213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 804583.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11332022213 its reverse (31222023311), we get a palindrome (42554045524).
The spelling of 11332022213 in words is "eleven billion, three hundred thirty-two million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •