Base | Representation |
---|---|
bin | 10110100110001011… |
… | …01111101010001101 |
3 | 1011022110102122200002 |
4 | 23103011233222031 |
5 | 144321121324401 |
6 | 5323442414045 |
7 | 606425323424 |
oct | 132305575215 |
9 | 34273378602 |
10 | 12131433101 |
11 | 5165972277 |
12 | 2426961325 |
13 | 11b44626a8 |
14 | 8312722bb |
15 | 4b0083a6b |
hex | 2d316fa8d |
12131433101 has 8 divisors (see below), whose sum is σ = 12789679680. Its totient is φ = 11475161568.
The previous prime is 12131433089. The next prime is 12131433113. The reversal of 12131433101 is 10133413121.
It is an interprime number because it is at equal distance from previous prime (12131433089) and next prime (12131433113).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12131433101 - 210 = 12131432077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12131433151) 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, 481136 + ... + 505721.
It is an arithmetic number, because the mean of its divisors is an integer number (1598709960).
Almost surely, 212131433101 is an apocalyptic number.
It is an amenable number.
12131433101 is a deficient number, since it is larger than the sum of its proper divisors (658246579).
12131433101 is an equidigital number, since it uses as much as digits as its factorization.
12131433101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 987523.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12131433101 its reverse (10133413121), we get a palindrome (22264846222).
The spelling of 12131433101 in words is "twelve billion, one hundred thirty-one million, four hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •