Base | Representation |
---|---|
bin | 110010010000001000100010… |
… | …001010001000111100101001 |
3 | 1001222112110000121100002200002 |
4 | 302100020202022020330221 |
5 | 212432021012022413001 |
6 | 2102015015110352345 |
7 | 64360342421266343 |
oct | 6220104212107451 |
9 | 1058473017302602 |
10 | 221011000201001 |
11 | 6446a26996108a |
12 | 209554b495b6b5 |
13 | 964232b80640a |
14 | 3c80dbd20c293 |
15 | 1a8400b26a46b |
hex | c90222288f29 |
221011000201001 has 8 divisors (see below), whose sum is σ = 225718443961920. Its totient is φ = 216323461065712.
The previous prime is 221011000200971. The next prime is 221011000201003. The reversal of 221011000201001 is 100102000110122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 221011000201001 - 226 = 221010933092137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221011000201003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4976133965 + ... + 4976178378.
It is an arithmetic number, because the mean of its divisors is an integer number (28214805495240).
Almost surely, 2221011000201001 is an apocalyptic number.
It is an amenable number.
221011000201001 is a deficient number, since it is larger than the sum of its proper divisors (4707443760919).
221011000201001 is an equidigital number, since it uses as much as digits as its factorization.
221011000201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9952312815.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 221011000201001 its reverse (100102000110122), we get a palindrome (321113000311123).
The spelling of 221011000201001 in words is "two hundred twenty-one trillion, eleven billion, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •