Base | Representation |
---|---|
bin | 11110010101100001111… |
… | …10101100011010100101 |
3 | 10200122111020212220121122 |
4 | 33022300332230122211 |
5 | 114034213413414001 |
6 | 2114503302023325 |
7 | 135210302644334 |
oct | 17126076543245 |
9 | 3618436786548 |
10 | 1042351310501 |
11 | 372071160356 |
12 | 14a021417b45 |
13 | 773a7519c97 |
14 | 38642ddbd1b |
15 | 1c1a98a7b1b |
hex | f2b0fac6a5 |
1042351310501 has 2 divisors, whose sum is σ = 1042351310502. Its totient is φ = 1042351310500.
The previous prime is 1042351310467. The next prime is 1042351310509. The reversal of 1042351310501 is 1050131532401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 816445973476 + 225905337025 = 903574^2 + 475295^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1042351310501 is a prime.
It is a super-2 number, since 2×10423513105012 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1042351310509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521175655250 + 521175655251.
It is an arithmetic number, because the mean of its divisors is an integer number (521175655251).
Almost surely, 21042351310501 is an apocalyptic number.
It is an amenable number.
1042351310501 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042351310501 is an equidigital number, since it uses as much as digits as its factorization.
1042351310501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 1042351310501 its reverse (1050131532401), we get a palindrome (2092482842902).
The spelling of 1042351310501 in words is "one trillion, forty-two billion, three hundred fifty-one million, three hundred ten thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •