Base | Representation |
---|---|
bin | 10010001101011010010… |
… | …110110001111001100011 |
3 | 11102121221211102201120011 |
4 | 102031122112301321203 |
5 | 131000231424413011 |
6 | 2354510215225351 |
7 | 156256440302353 |
oct | 22153226617143 |
9 | 4377854381504 |
10 | 1251351404131 |
11 | 442771277064 |
12 | 18262b078257 |
13 | 9100431cc3a |
14 | 447cc51ab63 |
15 | 2283d026621 |
hex | 1235a5b1e63 |
1251351404131 has 2 divisors, whose sum is σ = 1251351404132. Its totient is φ = 1251351404130.
The previous prime is 1251351404129. The next prime is 1251351404141. The reversal of 1251351404131 is 1314041531521.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1251351404131 - 21 = 1251351404129 is a prime.
It is a super-2 number, since 2×12513514041312 (a number of 25 digits) contains 22 as substring.
Together with 1251351404129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1251351404093 and 1251351404102.
It is not a weakly prime, because it can be changed into another prime (1251351404111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 625675702065 + 625675702066.
It is an arithmetic number, because the mean of its divisors is an integer number (625675702066).
Almost surely, 21251351404131 is an apocalyptic number.
1251351404131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1251351404131 is an equidigital number, since it uses as much as digits as its factorization.
1251351404131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 1251351404131 its reverse (1314041531521), we get a palindrome (2565392935652).
The spelling of 1251351404131 in words is "one trillion, two hundred fifty-one billion, three hundred fifty-one million, four hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •