Base | Representation |
---|---|
bin | 10110100010100101… |
… | …10101111010000011 |
3 | 1011020100202100110121 |
4 | 23101102311322003 |
5 | 144240413442011 |
6 | 5320445041111 |
7 | 605611312246 |
oct | 132122657203 |
9 | 34210670417 |
10 | 12101312131 |
11 | 514a969a07 |
12 | 2418856197 |
13 | 11ab14762c |
14 | 82b27125d |
15 | 4ac5d3e71 |
hex | 2d14b5e83 |
12101312131 has 2 divisors, whose sum is σ = 12101312132. Its totient is φ = 12101312130.
The previous prime is 12101312129. The next prime is 12101312141. The reversal of 12101312131 is 13121310121.
It is a happy number.
12101312131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12101312131 - 21 = 12101312129 is a prime.
It is a super-2 number, since 2×121013121312 (a number of 21 digits) contains 22 as substring.
Together with 12101312129, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (12101312141) 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 as a sum of consecutive naturals, namely, 6050656065 + 6050656066.
It is an arithmetic number, because the mean of its divisors is an integer number (6050656066).
Almost surely, 212101312131 is an apocalyptic number.
12101312131 is a deficient number, since it is larger than the sum of its proper divisors (1).
12101312131 is an equidigital number, since it uses as much as digits as its factorization.
12101312131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 12101312131 its reverse (13121310121), we get a palindrome (25222622252).
The spelling of 12101312131 in words is "twelve billion, one hundred one million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •