Base | Representation |
---|---|
bin | 110010010000010000111011… |
… | …110110100001110001010001 |
3 | 1001222120022022021221102122020 |
4 | 302100100323312201301101 |
5 | 212432143000411431001 |
6 | 2102023110202002053 |
7 | 64361112110445660 |
oct | 6220207366416121 |
9 | 1058508267842566 |
10 | 221020021202001 |
11 | 64473078a9670a |
12 | 209571b1aa6329 |
13 | 964313872a628 |
14 | 3c815d732cdd7 |
15 | 1a843881e4736 |
hex | c9043bda1c51 |
221020021202001 has 8 divisors (see below), whose sum is σ = 336792413260224. Its totient is φ = 126297154972560.
The previous prime is 221020021201919. The next prime is 221020021202003. The reversal of 221020021202001 is 100202120020122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221020021202001 - 27 = 221020021201873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (221020021202003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5262381457170 + ... + 5262381457211.
It is an arithmetic number, because the mean of its divisors is an integer number (42099051657528).
Almost surely, 2221020021202001 is an apocalyptic number.
221020021202001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
221020021202001 is a deficient number, since it is larger than the sum of its proper divisors (115772392058223).
221020021202001 is a wasteful number, since it uses less digits than its factorization.
221020021202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10524762914391.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 221020021202001 its reverse (100202120020122), we get a palindrome (321222141222123).
The spelling of 221020021202001 in words is "two hundred twenty-one trillion, twenty billion, twenty-one million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •