Base | Representation |
---|---|
bin | 11101011011010100111… |
… | …01000100100010011101 |
3 | 10120122211112021112102022 |
4 | 32231222131010202131 |
5 | 113031214422221341 |
6 | 2052254445105525 |
7 | 133023040263011 |
oct | 16555235044235 |
9 | 3518745245368 |
10 | 1011103320221 |
11 | 35a8965127a5 |
12 | 143b605582a5 |
13 | 74467729cc7 |
14 | 36d1ad30541 |
15 | 1b47b413e4b |
hex | eb6a74489d |
1011103320221 has 8 divisors (see below), whose sum is σ = 1013553953280. Its totient is φ = 1008653838192.
The previous prime is 1011103320217. The next prime is 1011103320223. The reversal of 1011103320221 is 1220233011101.
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 1011103320221 - 22 = 1011103320217 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1011103320221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011103320223) 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, 1484435 + ... + 2055663.
It is an arithmetic number, because the mean of its divisors is an integer number (126694244160).
Almost surely, 21011103320221 is an apocalyptic number.
It is an amenable number.
1011103320221 is a deficient number, since it is larger than the sum of its proper divisors (2450633059).
1011103320221 is an equidigital number, since it uses as much as digits as its factorization.
1011103320221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575515.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1011103320221 its reverse (1220233011101), we get a palindrome (2231336331322).
The spelling of 1011103320221 in words is "one trillion, eleven billion, one hundred three million, three hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •