Base | Representation |
---|---|
bin | 1010000001100000110111… |
… | …1100101111110110110001 |
3 | 1110000121102210212102121202 |
4 | 2200120031330233312301 |
5 | 2421032223222010001 |
6 | 35235011020500545 |
7 | 2215151426151131 |
oct | 240301574576661 |
9 | 43017383772552 |
10 | 11021120110001 |
11 | 356a037a89181 |
12 | 129bb729aa755 |
13 | 61c396ba0b71 |
14 | 2a15d4512ac1 |
15 | 141a4092e96b |
hex | a060df2fdb1 |
11021120110001 has 8 divisors (see below), whose sum is σ = 11291223148800. Its totient is φ = 10751078748960.
The previous prime is 11021120109971. The next prime is 11021120110027. The reversal of 11021120110001 is 10001102112011.
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 11021120110001 - 222 = 11021115915697 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11021120110061) 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, 15057581 + ... + 15772538.
It is an arithmetic number, because the mean of its divisors is an integer number (1411402893600).
Almost surely, 211021120110001 is an apocalyptic number.
It is an amenable number.
11021120110001 is a deficient number, since it is larger than the sum of its proper divisors (270103038799).
11021120110001 is an equidigital number, since it uses as much as digits as its factorization.
11021120110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30838879.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11021120110001 its reverse (10001102112011), we get a palindrome (21022222222012).
The spelling of 11021120110001 in words is "eleven trillion, twenty-one billion, one hundred twenty million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •