Base | Representation |
---|---|
bin | 10110100011111000… |
… | …00111110001010001 |
3 | 1011021010010010011222 |
4 | 23101330013301101 |
5 | 144301201230301 |
6 | 5321513014425 |
7 | 606102301460 |
oct | 132174076121 |
9 | 34233103158 |
10 | 12112133201 |
11 | 5155a8aa43 |
12 | 24203b4415 |
13 | 11b0465b2c |
14 | 82c88a9d7 |
15 | 4ad52031b |
hex | 2d1f07c51 |
12112133201 has 16 divisors (see below), whose sum is σ = 14485976064. Its totient is φ = 9901780944.
The previous prime is 12112133183. The next prime is 12112133213. The reversal of 12112133201 is 10233121121.
12112133201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12112133201 - 210 = 12112132177 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12112133201.
It is not an unprimeable number, because it can be changed into a prime (12112133251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52535 + ... + 164268.
It is an arithmetic number, because the mean of its divisors is an integer number (905373504).
Almost surely, 212112133201 is an apocalyptic number.
It is an amenable number.
12112133201 is a deficient number, since it is larger than the sum of its proper divisors (2373842863).
12112133201 is a wasteful number, since it uses less digits than its factorization.
12112133201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217180.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12112133201 its reverse (10233121121), we get a palindrome (22345254322).
The spelling of 12112133201 in words is "twelve billion, one hundred twelve million, one hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •