Base | Representation |
---|---|
bin | 1010000000010101111111… |
… | …1001110000011011000001 |
3 | 1102221200120000101021120212 |
4 | 2200011133321300123001 |
5 | 2420220042134033441 |
6 | 35221444322243505 |
7 | 2213540352004040 |
oct | 240053771603301 |
9 | 42850500337525 |
10 | 11001020221121 |
11 | 3561563134167 |
12 | 12980a34b6595 |
13 | 61a5128c11a8 |
14 | 2a0648c68557 |
15 | 141266031eeb |
hex | a015fe706c1 |
11001020221121 has 8 divisors (see below), whose sum is σ = 12576371253120. Its totient is φ = 9426613367808.
The previous prime is 11001020221099. The next prime is 11001020221181. The reversal of 11001020221121 is 12112202010011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11001020221121 - 26 = 11001020221057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11001020221096 and 11001020221105.
It is not an unprimeable number, because it can be changed into a prime (11001020221181) 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, 236019701 + ... + 236066306.
It is an arithmetic number, because the mean of its divisors is an integer number (1572046406640).
Almost surely, 211001020221121 is an apocalyptic number.
It is an amenable number.
11001020221121 is a deficient number, since it is larger than the sum of its proper divisors (1575351031999).
11001020221121 is an equidigital number, since it uses as much as digits as its factorization.
11001020221121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472089343.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11001020221121 its reverse (12112202010011), we get a palindrome (23113222231132).
The spelling of 11001020221121 in words is "eleven trillion, one billion, twenty million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •