Base | Representation |
---|---|
bin | 1010000000111110111100… |
… | …0100110111101100111001 |
3 | 1102222201221001202020000011 |
4 | 2200033233010313230321 |
5 | 2420410100111223001 |
6 | 35230503142541521 |
7 | 2214406633245544 |
oct | 240175704675471 |
9 | 42881831666004 |
10 | 11012012211001 |
11 | 35661938a091a |
12 | 129a2507378a1 |
13 | 61b574c72909 |
14 | 2a0daca5185b |
15 | 1416ab03cd51 |
hex | a03ef137b39 |
11012012211001 has 4 divisors (see below), whose sum is σ = 11017376076772. Its totient is φ = 11006648345232.
The previous prime is 11012012210987. The next prime is 11012012211047. The reversal of 11012012211001 is 10011221021011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6177466673401 + 4834545537600 = 2485451^2 + 2198760^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012012211001 - 237 = 10874573257529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11012012211401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2681929806 + ... + 2681933911.
It is an arithmetic number, because the mean of its divisors is an integer number (2754344019193).
Almost surely, 211012012211001 is an apocalyptic number.
It is an amenable number.
11012012211001 is a deficient number, since it is larger than the sum of its proper divisors (5363865771).
11012012211001 is an equidigital number, since it uses as much as digits as its factorization.
11012012211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5363865770.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11012012211001 its reverse (10011221021011), we get a palindrome (21023233232012).
The spelling of 11012012211001 in words is "eleven trillion, twelve billion, twelve million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •