Base | Representation |
---|---|
bin | 11110010001011001010… |
… | …01110100010000001111 |
3 | 10200102202112102220101002 |
4 | 33020230221310100033 |
5 | 114020142044320241 |
6 | 2113455114210515 |
7 | 135101264464352 |
oct | 17105451642017 |
9 | 3612675386332 |
10 | 1040131245071 |
11 | 371131a76336 |
12 | 149701a23a3b |
13 | 771125b14b9 |
14 | 384b221a299 |
15 | 1c0c9a2589b |
hex | f22ca7440f |
1040131245071 has 2 divisors, whose sum is σ = 1040131245072. Its totient is φ = 1040131245070.
The previous prime is 1040131245031. The next prime is 1040131245091. The reversal of 1040131245071 is 1705421310401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1040131245071 - 226 = 1040064136207 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1040131245031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520065622535 + 520065622536.
It is an arithmetic number, because the mean of its divisors is an integer number (520065622536).
Almost surely, 21040131245071 is an apocalyptic number.
1040131245071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1040131245071 is an equidigital number, since it uses as much as digits as its factorization.
1040131245071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 29.
Adding to 1040131245071 its reverse (1705421310401), we get a palindrome (2745552555472).
The spelling of 1040131245071 in words is "one trillion, forty billion, one hundred thirty-one million, two hundred forty-five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •