Base | Representation |
---|---|
bin | 10000010111000110001… |
… | …110101110001010100011 |
3 | 10222111001020210002221220 |
4 | 100113012032232022203 |
5 | 121410042411242011 |
6 | 2220300224350123 |
7 | 144141335056323 |
oct | 20270616561243 |
9 | 3874036702856 |
10 | 1124312212131 |
11 | 3a38aaa29899 |
12 | 161a95a75343 |
13 | 82039989b04 |
14 | 3c5ba375283 |
15 | 1e3a50b4506 |
hex | 105c63ae2a3 |
1124312212131 has 4 divisors (see below), whose sum is σ = 1499082949512. Its totient is φ = 749541474752.
The previous prime is 1124312212129. The next prime is 1124312212193. The reversal of 1124312212131 is 1312122134211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1124312212131 - 21 = 1124312212129 is a prime.
It is a super-2 number, since 2×11243122121312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1124312202131) 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 3 ways as a sum of consecutive naturals, for example, 187385368686 + ... + 187385368691.
It is an arithmetic number, because the mean of its divisors is an integer number (374770737378).
Almost surely, 21124312212131 is an apocalyptic number.
1124312212131 is a deficient number, since it is larger than the sum of its proper divisors (374770737381).
1124312212131 is an equidigital number, since it uses as much as digits as its factorization.
1124312212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374770737380.
The product of its digits is 576, while the sum is 24.
Adding to 1124312212131 its reverse (1312122134211), we get a palindrome (2436434346342).
The spelling of 1124312212131 in words is "one trillion, one hundred twenty-four billion, three hundred twelve million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •