Base | Representation |
---|---|
bin | 1010000001100101010001… |
… | …1110010001001001000101 |
3 | 1110000201111021020211012112 |
4 | 2200121110132101021011 |
5 | 2421042134121132323 |
6 | 35235324244430405 |
7 | 2215222644134120 |
oct | 240312436211105 |
9 | 43021437224175 |
10 | 11022303302213 |
11 | 356a594954a85 |
12 | 12a02430a8405 |
13 | 61c52505bbb8 |
14 | 2a16a77093b7 |
15 | 141aae74a178 |
hex | a0654791245 |
11022303302213 has 8 divisors (see below), whose sum is σ = 12937375304832. Its totient is φ = 9192345610896.
The previous prime is 11022303302161. The next prime is 11022303302233. The reversal of 11022303302213 is 31220330322011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11022303302213 - 218 = 11022303040069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022303302233) 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 in 7 ways as a sum of consecutive naturals, for example, 21278577545 + ... + 21278578062.
It is an arithmetic number, because the mean of its divisors is an integer number (1617171913104).
Almost surely, 211022303302213 is an apocalyptic number.
It is an amenable number.
11022303302213 is a deficient number, since it is larger than the sum of its proper divisors (1915072002619).
11022303302213 is an equidigital number, since it uses as much as digits as its factorization.
11022303302213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42557155651.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 11022303302213 its reverse (31220330322011), we get a palindrome (42242633624224).
The spelling of 11022303302213 in words is "eleven trillion, twenty-two billion, three hundred three million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •