Base | Representation |
---|---|
bin | 1011000001000001100000… |
… | …0010100100000101100001 |
3 | 1120212220201211001121011011 |
4 | 2300100120002210011201 |
5 | 3041421302020200001 |
6 | 41432134543220521 |
7 | 2360035611432445 |
oct | 260203002440541 |
9 | 46786654047134 |
10 | 12112211100001 |
11 | 394a83a446091 |
12 | 1437516ba7741 |
13 | 69b23b00658c |
14 | 2dc33c6cc825 |
15 | 1600ee1c8d51 |
hex | b04180a4161 |
12112211100001 has 8 divisors (see below), whose sum is σ = 12394227938400. Its totient is φ = 11830209603072.
The previous prime is 12112211099987. The next prime is 12112211100013. The reversal of 12112211100001 is 10000111221121.
It is a happy number.
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 12112211100001 - 25 = 12112211099969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12112211106001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2230240 + ... + 5403553.
It is an arithmetic number, because the mean of its divisors is an integer number (1549278492300).
Almost surely, 212112211100001 is an apocalyptic number.
It is an amenable number.
12112211100001 is a deficient number, since it is larger than the sum of its proper divisors (282016838399).
12112211100001 is an equidigital number, since it uses as much as digits as its factorization.
12112211100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7670735.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12112211100001 its reverse (10000111221121), we get a palindrome (22112322321122).
The spelling of 12112211100001 in words is "twelve trillion, one hundred twelve billion, two hundred eleven million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •