Base | Representation |
---|---|
bin | 11110100110000111001… |
… | …00011010111110100111 |
3 | 10201111110122012221111002 |
4 | 33103003210122332213 |
5 | 114210431300000111 |
6 | 2122534454503515 |
7 | 135644014061354 |
oct | 17230344327647 |
9 | 3644418187432 |
10 | 1051253125031 |
11 | 375919a8a36a |
12 | 14b8a6664b9b |
13 | 78195840665 |
14 | 38c4937562b |
15 | 1c52b13c63b |
hex | f4c391afa7 |
1051253125031 has 2 divisors, whose sum is σ = 1051253125032. Its totient is φ = 1051253125030.
The previous prime is 1051253125001. The next prime is 1051253125037. The reversal of 1051253125031 is 1305213521501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1051253125031 - 234 = 1034073255847 is a prime.
It is a super-2 number, since 2×10512531250312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1051253124985 and 1051253125003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1051253125037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525626562515 + 525626562516.
It is an arithmetic number, because the mean of its divisors is an integer number (525626562516).
Almost surely, 21051253125031 is an apocalyptic number.
1051253125031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051253125031 is an equidigital number, since it uses as much as digits as its factorization.
1051253125031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 1051253125031 its reverse (1305213521501), we get a palindrome (2356466646532).
The spelling of 1051253125031 in words is "one trillion, fifty-one billion, two hundred fifty-three million, one hundred twenty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •