Base | Representation |
---|---|
bin | 110010010000001010011111… |
… | …011111110000100001100011 |
3 | 1001222112122110011011101020002 |
4 | 302100022133133300201203 |
5 | 212432034313333121011 |
6 | 2102020003505210215 |
7 | 64360445504044352 |
oct | 6220123737604143 |
9 | 1058478404141202 |
10 | 221013103020131 |
11 | 64470148945234 |
12 | 209559a103096b |
13 | 96425a53704a6 |
14 | 3c8113c5cd999 |
15 | 1a840d0b8cc3b |
hex | c9029f7f0863 |
221013103020131 has 2 divisors, whose sum is σ = 221013103020132. Its totient is φ = 221013103020130.
The previous prime is 221013103020121. The next prime is 221013103020211. The reversal of 221013103020131 is 131020301310122.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221013103020131 is a prime.
It is a super-2 number, since 2×2210131030201312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (221013103020121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110506551510065 + 110506551510066.
It is an arithmetic number, because the mean of its divisors is an integer number (110506551510066).
Almost surely, 2221013103020131 is an apocalyptic number.
221013103020131 is a deficient number, since it is larger than the sum of its proper divisors (1).
221013103020131 is an equidigital number, since it uses as much as digits as its factorization.
221013103020131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 221013103020131 its reverse (131020301310122), we get a palindrome (352033404330253).
The spelling of 221013103020131 in words is "two hundred twenty-one trillion, thirteen billion, one hundred three million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •