Base | Representation |
---|---|
bin | 11101101101110011010… |
… | …10010000001000001110 |
3 | 10121121102210020021100221 |
4 | 32312321222100020032 |
5 | 113212023130011342 |
6 | 2101015011141554 |
7 | 133523610512062 |
oct | 16667152201016 |
9 | 3547383207327 |
10 | 1021022110222 |
11 | 3640163aa504 |
12 | 145a6a2a48ba |
13 | 7538865240a |
14 | 375bc393aa2 |
15 | 1b85c0cea67 |
hex | edb9a9020e |
1021022110222 has 4 divisors (see below), whose sum is σ = 1531533165336. Its totient is φ = 510511055110.
The previous prime is 1021022110187. The next prime is 1021022110223. The reversal of 1021022110222 is 2220112201201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×10210221102222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1021022110196 and 1021022110205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021022110223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 255255527554 + ... + 255255527557.
It is an arithmetic number, because the mean of its divisors is an integer number (382883291334).
Almost surely, 21021022110222 is an apocalyptic number.
1021022110222 is a deficient number, since it is larger than the sum of its proper divisors (510511055114).
1021022110222 is an equidigital number, since it uses as much as digits as its factorization.
1021022110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510511055113.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1021022110222 its reverse (2220112201201), we get a palindrome (3241134311423).
The spelling of 1021022110222 in words is "one trillion, twenty-one billion, twenty-two million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.854 sec. • engine limits •