Base | Representation |
---|---|
bin | 1010000111010101101111… |
… | …0101001100010011000001 |
3 | 1110101011210022112110111202 |
4 | 2201311123311030103001 |
5 | 2424202220004000001 |
6 | 35353002551550545 |
7 | 2225323655530064 |
oct | 241653365142301 |
9 | 43334708473452 |
10 | 11121211000001 |
11 | 35a852a753283 |
12 | 12b744708b455 |
13 | 62895848466b |
14 | 2a63ab6728db |
15 | 14444cb1e96b |
hex | a1d5bd4c4c1 |
11121211000001 has 4 divisors (see below), whose sum is σ = 11775399882372. Its totient is φ = 10467022117632.
The previous prime is 11121210999991. The next prime is 11121211000037. The reversal of 11121211000001 is 10000011212111.
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 3561433254976 + 7559777745025 = 1887176^2 + 2749505^2 .
It is a cyclic number.
It is not a de Polignac number, because 11121211000001 - 242 = 6723164488897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11121211006001) 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, 327094441160 + ... + 327094441193.
It is an arithmetic number, because the mean of its divisors is an integer number (2943849970593).
Almost surely, 211121211000001 is an apocalyptic number.
It is an amenable number.
11121211000001 is a deficient number, since it is larger than the sum of its proper divisors (654188882371).
11121211000001 is an equidigital number, since it uses as much as digits as its factorization.
11121211000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654188882370.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11121211000001 its reverse (10000011212111), we get a palindrome (21121222212112).
The spelling of 11121211000001 in words is "eleven trillion, one hundred twenty-one billion, two hundred eleven million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •