Base | Representation |
---|---|
bin | 1001010010111100001100… |
… | …1001000001110011110011 |
3 | 1100012010012010211102102111 |
4 | 2110233003021001303303 |
5 | 2314430102241333021 |
6 | 33423244010030151 |
7 | 2103304636025332 |
oct | 224570311016363 |
9 | 40163163742374 |
10 | 10221001121011 |
11 | 329077a74327a |
12 | 1190a94718357 |
13 | 591ab4392805 |
14 | 2749b0455d19 |
15 | 12ad11e868e1 |
hex | 94bc3241cf3 |
10221001121011 has 8 divisors (see below), whose sum is σ = 10552915021824. Its totient is φ = 9889224981960.
The previous prime is 10221001120987. The next prime is 10221001121021. The reversal of 10221001121011 is 11012110012201.
It is a happy number.
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 10221001121011 - 223 = 10220992732403 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10221001120982 and 10221001121000.
It is not an unprimeable number, because it can be changed into a prime (10221001121021) 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, 34289635 + ... + 34586428.
It is an arithmetic number, because the mean of its divisors is an integer number (1319114377728).
Almost surely, 210221001121011 is an apocalyptic number.
10221001121011 is a deficient number, since it is larger than the sum of its proper divisors (331913900813).
10221001121011 is an equidigital number, since it uses as much as digits as its factorization.
10221001121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68880881.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10221001121011 its reverse (11012110012201), we get a palindrome (21233111133212).
The spelling of 10221001121011 in words is "ten trillion, two hundred twenty-one billion, one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •