Base | Representation |
---|---|
bin | 1011000000111001010001… |
… | …0100001010011011101001 |
3 | 1120212201000210121000220002 |
4 | 2300032110110022123221 |
5 | 3041402240241333001 |
6 | 41431131355512345 |
7 | 2356630055062130 |
oct | 260162424123351 |
9 | 46781023530802 |
10 | 12110001121001 |
11 | 3949905a20163 |
12 | 1436bbaa586b5 |
13 | 69ac781bcab4 |
14 | 2dc1acdb4917 |
15 | 16002018a46b |
hex | b039450a6e9 |
12110001121001 has 8 divisors (see below), whose sum is σ = 14066886548544. Its totient is φ = 10209837010320.
The previous prime is 12110001120991. The next prime is 12110001121013. The reversal of 12110001121001 is 10012110001121.
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 12110001121001 - 210 = 12110001119977 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 (12110001121201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14180328755 + ... + 14180329608.
It is an arithmetic number, because the mean of its divisors is an integer number (1758360818568).
Almost surely, 212110001121001 is an apocalyptic number.
It is an amenable number.
12110001121001 is a deficient number, since it is larger than the sum of its proper divisors (1956885427543).
12110001121001 is an equidigital number, since it uses as much as digits as its factorization.
12110001121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28360658431.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 12110001121001 its reverse (10012110001121), we get a palindrome (22122111122122).
The spelling of 12110001121001 in words is "twelve trillion, one hundred ten billion, one million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •