Base | Representation |
---|---|
bin | 11111001111011010011… |
… | …11100101100110001101 |
3 | 10210121200222112202210211 |
4 | 33213231033211212031 |
5 | 120041334322034203 |
6 | 2141043045002421 |
7 | 140360345112256 |
oct | 17475517454615 |
9 | 3717628482724 |
10 | 1073427143053 |
11 | 3842687022a1 |
12 | 1540546b3411 |
13 | 7a2ba750795 |
14 | 39d50293b2d |
15 | 1cdc7b91c6d |
hex | f9ed3e598d |
1073427143053 has 2 divisors, whose sum is σ = 1073427143054. Its totient is φ = 1073427143052.
The previous prime is 1073427143039. The next prime is 1073427143093. The reversal of 1073427143053 is 3503417243701.
It is a happy number.
It is an a-pointer prime, because the next prime (1073427143093) can be obtained adding 1073427143053 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1068581173284 + 4845969769 = 1033722^2 + 69613^2 .
It is a cyclic number.
It is not a de Polignac number, because 1073427143053 - 237 = 935988189581 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1073427142997 and 1073427143015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1073427143093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 536713571526 + 536713571527.
It is an arithmetic number, because the mean of its divisors is an integer number (536713571527).
Almost surely, 21073427143053 is an apocalyptic number.
It is an amenable number.
1073427143053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1073427143053 is an equidigital number, since it uses as much as digits as its factorization.
1073427143053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 211680, while the sum is 40.
The spelling of 1073427143053 in words is "one trillion, seventy-three billion, four hundred twenty-seven million, one hundred forty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •