Base | Representation |
---|---|
bin | 11101011011100011001… |
… | …10011101011101110101 |
3 | 10120200010212220011220212 |
4 | 32231301212131131311 |
5 | 113031441121102013 |
6 | 2052314411035205 |
7 | 133026024365165 |
oct | 16556146353565 |
9 | 3520125804825 |
10 | 1011223222133 |
11 | 35a948167893 |
12 | 143b9473bb05 |
13 | 7448651b397 |
14 | 36d2cc225a5 |
15 | 1b486bea6a8 |
hex | eb7199d775 |
1011223222133 has 16 divisors (see below), whose sum is σ = 1081366640640. Its totient is φ = 942274968576.
The previous prime is 1011223222069. The next prime is 1011223222147. The reversal of 1011223222133 is 3312223221101.
It is not a de Polignac number, because 1011223222133 - 26 = 1011223222069 is a prime.
It is a super-2 number, since 2×10112232221332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011223222099 and 1011223222108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011223222193) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2857853 + ... + 3192141.
It is an arithmetic number, because the mean of its divisors is an integer number (67585415040).
Almost surely, 21011223222133 is an apocalyptic number.
It is an amenable number.
1011223222133 is a deficient number, since it is larger than the sum of its proper divisors (70143418507).
1011223222133 is a wasteful number, since it uses less digits than its factorization.
1011223222133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336076.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1011223222133 its reverse (3312223221101), we get a palindrome (4323446443234).
The spelling of 1011223222133 in words is "one trillion, eleven billion, two hundred twenty-three million, two hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •