Base | Representation |
---|---|
bin | 10110100011111000… |
… | …11000011000001111 |
3 | 1011021010020120111121 |
4 | 23101330120120033 |
5 | 144301210414411 |
6 | 5321514301411 |
7 | 606103004014 |
oct | 132174303017 |
9 | 34233216447 |
10 | 12112201231 |
11 | 5156027069 |
12 | 2420427867 |
13 | 11b048aaa0 |
14 | 82c8a770b |
15 | 4ad535571 |
hex | 2d1f1860f |
12112201231 has 16 divisors (see below), whose sum is σ = 13094200000. Its totient is φ = 11137471488.
The previous prime is 12112201207. The next prime is 12112201271. The reversal of 12112201231 is 13210221121.
12112201231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12112201231 - 213 = 12112193039 is a prime.
It is a super-2 number, since 2×121122012312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12112201271) 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, 6445150 + ... + 6447028.
It is an arithmetic number, because the mean of its divisors is an integer number (818387500).
Almost surely, 212112201231 is an apocalyptic number.
12112201231 is a deficient number, since it is larger than the sum of its proper divisors (981998769).
12112201231 is a wasteful number, since it uses less digits than its factorization.
12112201231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3538.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12112201231 its reverse (13210221121), we get a palindrome (25322422352).
The spelling of 12112201231 in words is "twelve billion, one hundred twelve million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •