Base | Representation |
---|---|
bin | 1010000001011101000111… |
… | …0111111000100111100100 |
3 | 1110000111211120022102001122 |
4 | 2200113101313320213210 |
5 | 2421023142210432322 |
6 | 35234323013513112 |
7 | 2215114440113351 |
oct | 240272167704744 |
9 | 43014746272048 |
10 | 11020112202212 |
11 | 3569670054133 |
12 | 129b931342798 |
13 | 61c266125519 |
14 | 2a153a707628 |
15 | 1419d21da442 |
hex | a05d1df89e4 |
11020112202212 has 18 divisors (see below), whose sum is σ = 19474249159638. Its totient is φ = 5456560389792.
The previous prime is 11020112202179. The next prime is 11020112202217. The reversal of 11020112202212 is 21220221102011.
11020112202212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 9071698229476 + 1948413972736 = 3011926^2 + 1395856^2 .
It is not an unprimeable number, because it can be changed into a prime (11020112202217) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 129801473 + ... + 129886344.
It is an arithmetic number, because the mean of its divisors is an integer number (1081902731091).
Almost surely, 211020112202212 is an apocalyptic number.
It is an amenable number.
11020112202212 is a deficient number, since it is larger than the sum of its proper divisors (8454136957426).
11020112202212 is a wasteful number, since it uses less digits than its factorization.
11020112202212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259688027 (or 259687922 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11020112202212 its reverse (21220221102011), we get a palindrome (32240333304223).
The spelling of 11020112202212 in words is "eleven trillion, twenty billion, one hundred twelve million, two hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •