Base | Representation |
---|---|
bin | 11110011110111110100… |
… | …00101010100000100001 |
3 | 10201010120200200020201211 |
4 | 33033133100222200201 |
5 | 114130110210144023 |
6 | 2121102424230121 |
7 | 135450053252512 |
oct | 17173720524041 |
9 | 3633520606654 |
10 | 1047422740513 |
11 | 374233915826 |
12 | 14abb790b341 |
13 | 77a050c8246 |
14 | 389a4774a09 |
15 | 1c3a4c1da0d |
hex | f3df42a821 |
1047422740513 has 2 divisors, whose sum is σ = 1047422740514. Its totient is φ = 1047422740512.
The previous prime is 1047422740433. The next prime is 1047422740523. The reversal of 1047422740513 is 3150472247401.
It is a happy number.
1047422740513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 972635805729 + 74786934784 = 986223^2 + 273472^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1047422740513 is a prime.
It is not a weakly prime, because it can be changed into another prime (1047422740523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 523711370256 + 523711370257.
It is an arithmetic number, because the mean of its divisors is an integer number (523711370257).
Almost surely, 21047422740513 is an apocalyptic number.
It is an amenable number.
1047422740513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1047422740513 is an equidigital number, since it uses as much as digits as its factorization.
1047422740513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 188160, while the sum is 40.
Adding to 1047422740513 its reverse (3150472247401), we get a palindrome (4197894987914).
The spelling of 1047422740513 in words is "one trillion, forty-seven billion, four hundred twenty-two million, seven hundred forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •