Base | Representation |
---|---|
bin | 1010000000111000001110… |
… | …1010000011111101100101 |
3 | 1102222120021110121111101112 |
4 | 2200032003222003331211 |
5 | 2420342402231134341 |
6 | 35230004243434405 |
7 | 2214314161011125 |
oct | 240160352037545 |
9 | 42876243544345 |
10 | 11010210021221 |
11 | 3565449580a84 |
12 | 1299a29085a05 |
13 | 61b348796c28 |
14 | 2a0c7b568c85 |
15 | 141602c00aeb |
hex | a0383a83f65 |
11010210021221 has 16 divisors (see below), whose sum is σ = 12271676356800. Its totient is φ = 9816965330688.
The previous prime is 11010210021199. The next prime is 11010210021257. The reversal of 11010210021221 is 12212001201011.
It is a de Polignac number, because none of the positive numbers 2k-11010210021221 is a prime.
It is a super-2 number, since 2×110102100212212 (a number of 27 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 = 11010210021196 and 11010210021205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010210021271) 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, 18204875 + ... + 18799943.
It is an arithmetic number, because the mean of its divisors is an integer number (766979772300).
Almost surely, 211010210021221 is an apocalyptic number.
It is an amenable number.
11010210021221 is a deficient number, since it is larger than the sum of its proper divisors (1261466335579).
11010210021221 is a wasteful number, since it uses less digits than its factorization.
11010210021221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 652388.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11010210021221 its reverse (12212001201011), we get a palindrome (23222211222232).
The spelling of 11010210021221 in words is "eleven trillion, ten billion, two hundred ten million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •