Base | Representation |
---|---|
bin | 10110100110001000… |
… | …01011010100101001 |
3 | 1011022102122202220121 |
4 | 23103010023110221 |
5 | 144321020201441 |
6 | 5323425523241 |
7 | 606421662301 |
oct | 132304132451 |
9 | 34272582817 |
10 | 12131022121 |
11 | 5165711519 |
12 | 24267a3521 |
13 | 11b434a5ca |
14 | 8311a6601 |
15 | 4b0001dd1 |
hex | 2d310b529 |
12131022121 has 4 divisors (see below), whose sum is σ = 12162696192. Its totient is φ = 12099348052.
The previous prime is 12131022041. The next prime is 12131022143. The reversal of 12131022121 is 12122013121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12122013121 = 4153 ⋅2918857.
It is a cyclic number.
It is not a de Polignac number, because 12131022121 - 217 = 12130891049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12131022095 and 12131022104.
It is not an unprimeable number, because it can be changed into a prime (12131022521) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15836461 + ... + 15837226.
It is an arithmetic number, because the mean of its divisors is an integer number (3040674048).
Almost surely, 212131022121 is an apocalyptic number.
It is an amenable number.
12131022121 is a deficient number, since it is larger than the sum of its proper divisors (31674071).
12131022121 is an equidigital number, since it uses as much as digits as its factorization.
12131022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31674070.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12131022121 its reverse (12122013121), we get a palindrome (24253035242).
The spelling of 12131022121 in words is "twelve billion, one hundred thirty-one million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •