Base | Representation |
---|---|
bin | 11101101101110010000… |
… | …00010000011000100110 |
3 | 10121121102000111221212012 |
4 | 32312321000100120212 |
5 | 113212012320214342 |
6 | 2101013535154222 |
7 | 133523415110630 |
oct | 16667100203046 |
9 | 3547360457765 |
10 | 1021011101222 |
11 | 364010170262 |
12 | 145a66675972 |
13 | 75386299508 |
14 | 375bab29a50 |
15 | 1b85b157b82 |
hex | edb9010626 |
1021011101222 has 16 divisors (see below), whose sum is σ = 1761896170752. Its totient is φ = 434678329800.
The previous prime is 1021011101221. The next prime is 1021011101233. The reversal of 1021011101222 is 2221011101201.
It is a super-2 number, since 2×10210111012222 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 1021011101197 and 1021011101206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021011101221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 241485848 + ... + 241490075.
It is an arithmetic number, because the mean of its divisors is an integer number (110118510672).
Almost surely, 21021011101222 is an apocalyptic number.
1021011101222 is a deficient number, since it is larger than the sum of its proper divisors (740885069530).
1021011101222 is a wasteful number, since it uses less digits than its factorization.
1021011101222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482976083.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1021011101222 its reverse (2221011101201), we get a palindrome (3242022202423).
The spelling of 1021011101222 in words is "one trillion, twenty-one billion, eleven million, one hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •