Base | Representation |
---|---|
bin | 110010010000010010000010… |
… | …110001010010011110111001 |
3 | 1001222120102101012202222202020 |
4 | 302100102002301102132321 |
5 | 212432202420004323001 |
6 | 2102023424223425053 |
7 | 64361153435610612 |
oct | 6220220261223671 |
9 | 1058512335688666 |
10 | 221021211011001 |
11 | 64473629671835 |
12 | 20957484455189 |
13 | 964329809431b |
14 | 3c816ab368c09 |
15 | 1a844078ba736 |
hex | c90482c527b9 |
221021211011001 has 4 divisors (see below), whose sum is σ = 294694948014672. Its totient is φ = 147347474007332.
The previous prime is 221021211010979. The next prime is 221021211011059. The reversal of 221021211011001 is 100110112120122.
It is a happy number.
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-221021211011001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (221021210011001) 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, 36836868501831 + ... + 36836868501836.
It is an arithmetic number, because the mean of its divisors is an integer number (73673737003668).
Almost surely, 2221021211011001 is an apocalyptic number.
It is an amenable number.
221021211011001 is a deficient number, since it is larger than the sum of its proper divisors (73673737003671).
221021211011001 is an equidigital number, since it uses as much as digits as its factorization.
221021211011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73673737003670.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 221021211011001 its reverse (100110112120122), we get a palindrome (321131323131123).
The spelling of 221021211011001 in words is "two hundred twenty-one trillion, twenty-one billion, two hundred eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •