Base | Representation |
---|---|
bin | 11101101111101001001… |
… | …10111111011100101000 |
3 | 10121200222201012201200002 |
4 | 32313310212333130220 |
5 | 113221034321024313 |
6 | 2101301101002132 |
7 | 133560250052633 |
oct | 16676446773450 |
9 | 3550881181602 |
10 | 1022011111208 |
11 | 3644836a059a |
12 | 1460a5553348 |
13 | 754b550b0b9 |
14 | 3767387ac1a |
15 | 1b8b8d3c058 |
hex | edf49bf728 |
1022011111208 has 8 divisors (see below), whose sum is σ = 1916270833530. Its totient is φ = 511005555600.
The previous prime is 1022011111207. The next prime is 1022011111249. The reversal of 1022011111208 is 8021111102201.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 938616067684 + 83395043524 = 968822^2 + 288782^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×10220111112082 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1022011111208.
It is not an unprimeable number, because it can be changed into a prime (1022011111201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63875694443 + ... + 63875694458.
Almost surely, 21022011111208 is an apocalyptic number.
It is an amenable number.
1022011111208 is a deficient number, since it is larger than the sum of its proper divisors (894259722322).
1022011111208 is a wasteful number, since it uses less digits than its factorization.
1022011111208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127751388907 (or 127751388903 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 1022011111208 its reverse (8021111102201), we get a palindrome (9043122213409).
The spelling of 1022011111208 in words is "one trillion, twenty-two billion, eleven million, one hundred eleven thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •