Base | Representation |
---|---|
bin | 1010000001000011011100… |
… | …1001001101111100001101 |
3 | 1102222212001022212211022202 |
4 | 2200100313021031330031 |
5 | 2420420034123411341 |
6 | 35231223134051245 |
7 | 2214451614362264 |
oct | 240206711157415 |
9 | 42885038784282 |
10 | 11013221310221 |
11 | 3566754351a79 |
12 | 129a529649b25 |
13 | 61b708601940 |
14 | 2a108546d5db |
15 | 14172c27479b |
hex | a043724df0d |
11013221310221 has 8 divisors (see below), whose sum is σ = 11894571989664. Its totient is φ = 10136753460720.
The previous prime is 11013221310209. The next prime is 11013221310241. The reversal of 11013221310221 is 12201312231011.
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 11013221310221 - 242 = 6615174799117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11013221310193 and 11013221310202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013221310241) 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, 1220702795 + ... + 1220711816.
It is an arithmetic number, because the mean of its divisors is an integer number (1486821498708).
Almost surely, 211013221310221 is an apocalyptic number.
It is an amenable number.
11013221310221 is a deficient number, since it is larger than the sum of its proper divisors (881350679443).
11013221310221 is a wasteful number, since it uses less digits than its factorization.
11013221310221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2441414971.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11013221310221 its reverse (12201312231011), we get a palindrome (23214533541232).
The spelling of 11013221310221 in words is "eleven trillion, thirteen billion, two hundred twenty-one million, three hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •