Base | Representation |
---|---|
bin | 1100110111101010100… |
… | …1011000110100011101 |
3 | 210010200220112122120111 |
4 | 3031322221120310131 |
5 | 12110303324031023 |
6 | 245323345450021 |
7 | 21655042336213 |
oct | 3157251306435 |
9 | 703626478514 |
10 | 221101002013 |
11 | 8584a82a341 |
12 | 36a26340911 |
13 | 17b07b38898 |
14 | a9b66c6cb3 |
15 | 5b40bc300d |
hex | 337aa58d1d |
221101002013 has 4 divisors (see below), whose sum is σ = 221134473280. Its totient is φ = 221067530748.
The previous prime is 221101001993. The next prime is 221101002037. The reversal of 221101002013 is 310200101122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221101002013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221101001984 and 221101002002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221101002053) 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, 16725723 + ... + 16738936.
It is an arithmetic number, because the mean of its divisors is an integer number (55283618320).
Almost surely, 2221101002013 is an apocalyptic number.
It is an amenable number.
221101002013 is a deficient number, since it is larger than the sum of its proper divisors (33471267).
221101002013 is an equidigital number, since it uses as much as digits as its factorization.
221101002013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33471266.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 221101002013 its reverse (310200101122), we get a palindrome (531301103135).
The spelling of 221101002013 in words is "two hundred twenty-one billion, one hundred one million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.173 sec. • engine limits •