Base | Representation |
---|---|
bin | 10001101000111000000… |
… | …011011110000011111011 |
3 | 11021212200210220102202001 |
4 | 101220320003132003323 |
5 | 124324411012224011 |
6 | 2324501340121431 |
7 | 153400331204005 |
oct | 21507003360373 |
9 | 4255623812661 |
10 | 1212121211131 |
11 | 42806a907456 |
12 | 176b00b36277 |
13 | 8a3c18ab79c |
14 | 4294a299375 |
15 | 217e3e007c1 |
hex | 11a380de0fb |
1212121211131 has 2 divisors, whose sum is σ = 1212121211132. Its totient is φ = 1212121211130.
The previous prime is 1212121211107. The next prime is 1212121211179. The reversal of 1212121211131 is 1311121212121.
It is a m-pointer prime, because the next prime (1212121211179) can be obtained adding 1212121211131 to its product of digits (48).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1212121211131 - 27 = 1212121211003 is a prime.
It is a super-2 number, since 2×12121212111312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212121211099 and 1212121211108.
It is not a weakly prime, because it can be changed into another prime (1212121211101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606060605565 + 606060605566.
It is an arithmetic number, because the mean of its divisors is an integer number (606060605566).
Almost surely, 21212121211131 is an apocalyptic number.
1212121211131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212121211131 is an equidigital number, since it uses as much as digits as its factorization.
1212121211131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 48, while the sum is 19.
Adding to 1212121211131 its reverse (1311121212121), we get a palindrome (2523242423252).
The spelling of 1212121211131 in words is "one trillion, two hundred twelve billion, one hundred twenty-one million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •