Base | Representation |
---|---|
bin | 110010010000010001110110… |
… | …010000111101100011110011 |
3 | 1001222120101211121000000000110 |
4 | 302100101312100331203303 |
5 | 212432202002302210344 |
6 | 2102023351330552403 |
7 | 64361145310413306 |
oct | 6220216620754363 |
9 | 1058511747000013 |
10 | 221021001210099 |
11 | 644735311a5262 |
12 | 20957426138703 |
13 | 9643263787c8c |
14 | 3c8168b554b3d |
15 | 1a843e42773b9 |
hex | c9047643d8f3 |
221021001210099 has 8 divisors (see below), whose sum is σ = 304856553393360. Its totient is φ = 142266391583456.
The previous prime is 221021001210029. The next prime is 221021001210223. The reversal of 221021001210099 is 990012100120122.
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 221021001210099 - 216 = 221021001144563 is a prime.
It is not an unprimeable number, because it can be changed into a prime (221021001210029) 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 in 7 ways as a sum of consecutive naturals, for example, 1270235639052 + ... + 1270235639225.
It is an arithmetic number, because the mean of its divisors is an integer number (38107069174170).
Almost surely, 2221021001210099 is an apocalyptic number.
221021001210099 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
221021001210099 is a deficient number, since it is larger than the sum of its proper divisors (83835552183261).
221021001210099 is a wasteful number, since it uses less digits than its factorization.
221021001210099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2540471278309.
The product of its (nonzero) digits is 1296, while the sum is 30.
The spelling of 221021001210099 in words is "two hundred twenty-one trillion, twenty-one billion, one million, two hundred ten thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •