Base | Representation |
---|---|
bin | 1111000010000… |
… | …10101001110011 |
3 | 22210021122121022 |
4 | 13201002221303 |
5 | 224240232011 |
6 | 20302450055 |
7 | 3060564461 |
oct | 741025163 |
9 | 283248538 |
10 | 126102131 |
11 | 651aa441 |
12 | 3629392b |
13 | 2018255c |
14 | 12a67831 |
15 | b10d8db |
hex | 7842a73 |
126102131 has 2 divisors, whose sum is σ = 126102132. Its totient is φ = 126102130.
The previous prime is 126102083. The next prime is 126102139. The reversal of 126102131 is 131201621.
It is a strong prime.
It is an emirp because it is prime and its reverse (131201621) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126102131 is a prime.
It is a super-2 number, since 2×1261021312 = 31803494885482322, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (126102139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63051065 + 63051066.
It is an arithmetic number, because the mean of its divisors is an integer number (63051066).
Almost surely, 2126102131 is an apocalyptic number.
126102131 is a deficient number, since it is larger than the sum of its proper divisors (1).
126102131 is an equidigital number, since it uses as much as digits as its factorization.
126102131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 126102131 is about 11229.5205151422. The cubic root of 126102131 is about 501.4652101245.
Adding to 126102131 its reverse (131201621), we get a palindrome (257303752).
It can be divided in two parts, 12610 and 2131, that added together give a palindrome (14741).
The spelling of 126102131 in words is "one hundred twenty-six million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •