Base | Representation |
---|---|
bin | 110010010000010010111111… |
… | …000001111010011101011011 |
3 | 1001222120111222200010122200201 |
4 | 302100102333001322131123 |
5 | 212432212002313031021 |
6 | 2102024112420443031 |
7 | 64361220463106353 |
oct | 6220227701723533 |
9 | 1058514880118621 |
10 | 221022222002011 |
11 | 64473aa83122a1 |
12 | 20957706b49477 |
13 | 96433c967c161 |
14 | 3c81765737b63 |
15 | 1a8446651d591 |
hex | c904bf07a75b |
221022222002011 has 4 divisors (see below), whose sum is σ = 221022307641024. Its totient is φ = 221022136363000.
The previous prime is 221022222001873. The next prime is 221022222002041. The reversal of 221022222002011 is 110200222220122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 221022222002011 - 223 = 221022213613403 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 221022222002011.
It is not an unprimeable number, because it can be changed into a prime (221022222002041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38823940 + ... + 44151361.
It is an arithmetic number, because the mean of its divisors is an integer number (55255576910256).
Almost surely, 2221022222002011 is an apocalyptic number.
221022222002011 is a deficient number, since it is larger than the sum of its proper divisors (85639013).
221022222002011 is an equidigital number, since it uses as much as digits as its factorization.
221022222002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85639012.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 221022222002011 its reverse (110200222220122), we get a palindrome (331222444222133).
The spelling of 221022222002011 in words is "two hundred twenty-one trillion, twenty-two billion, two hundred twenty-two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •