Base | Representation |
---|---|
bin | 1010001101000101111000… |
… | …0001011001010100011100 |
3 | 1110201121212022200110121012 |
4 | 2203101132001121110130 |
5 | 2432312111143020213 |
6 | 35510224520554352 |
7 | 2235422565266444 |
oct | 243213601312434 |
9 | 43647768613535 |
10 | 11220032001308 |
11 | 3636430617199 |
12 | 13126260229b8 |
13 | 635076943a30 |
14 | 2ab0a3cad124 |
15 | 146cd35bb4a8 |
hex | a345e05951c |
11220032001308 has 48 divisors (see below), whose sum is σ = 21260755565280. Its totient is φ = 5150256701184.
The previous prime is 11220032001287. The next prime is 11220032001329. The reversal of 11220032001308 is 80310023002211.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11220032001287) and next prime (11220032001329).
It is a super-2 number, since 2×112200320013082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 27280538 + ... + 27688766.
It is an arithmetic number, because the mean of its divisors is an integer number (442932407610).
Almost surely, 211220032001308 is an apocalyptic number.
It is an amenable number.
11220032001308 is a deficient number, since it is larger than the sum of its proper divisors (10040723563972).
11220032001308 is a wasteful number, since it uses less digits than its factorization.
11220032001308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411126 (or 411124 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11220032001308 its reverse (80310023002211), we get a palindrome (91530055003519).
The spelling of 11220032001308 in words is "eleven trillion, two hundred twenty billion, thirty-two million, one thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •