Base | Representation |
---|---|
bin | 10110100011111000… |
… | …00111010000111010 |
3 | 1011021010010000100021 |
4 | 23101330013100322 |
5 | 144301201144010 |
6 | 5321513001054 |
7 | 606102262441 |
oct | 132174072072 |
9 | 34233100307 |
10 | 12112131130 |
11 | 5155a89430 |
12 | 24203b318a |
13 | 11b0464bc8 |
14 | 82c889d58 |
15 | 4ad51e8da |
hex | 2d1f0743a |
12112131130 has 16 divisors (see below), whose sum is σ = 23783821344. Its totient is φ = 4404411280.
The previous prime is 12112131089. The next prime is 12112131133. The reversal of 12112131130 is 3113121121.
It is a happy number.
12112131130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (12112131133) 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 7 ways as a sum of consecutive naturals, for example, 55055032 + ... + 55055251.
It is an arithmetic number, because the mean of its divisors is an integer number (1486488834).
Almost surely, 212112131130 is an apocalyptic number.
12112131130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12112131130 is a deficient number, since it is larger than the sum of its proper divisors (11671690214).
12112131130 is a wasteful number, since it uses less digits than its factorization.
12112131130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110110301.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 12112131130 its reverse (3113121121), we get a palindrome (15225252251).
It can be divided in two parts, 121121 and 31130, that added together give a palindrome (152251).
The spelling of 12112131130 in words is "twelve billion, one hundred twelve million, one hundred thirty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •