Base | Representation |
---|---|
bin | 111010111001010011110… |
… | …010110000100110110101 |
3 | 112022220200212010212220222 |
4 | 322321103302300212311 |
5 | 1012302244320224203 |
6 | 12335142103104125 |
7 | 565255666643321 |
oct | 72712362604665 |
9 | 15286625125828 |
10 | 4047265008053 |
11 | 13204876487a3 |
12 | 554478a42045 |
13 | 23486a04c817 |
14 | ddc6272c981 |
15 | 7042a6a7038 |
hex | 3ae53cb09b5 |
4047265008053 has 2 divisors, whose sum is σ = 4047265008054. Its totient is φ = 4047265008052.
The previous prime is 4047265007999. The next prime is 4047265008071. The reversal of 4047265008053 is 3508005627404.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3669190053169 + 378074954884 = 1915513^2 + 614878^2 .
It is a cyclic number.
It is not a de Polignac number, because 4047265008053 - 214 = 4047264991669 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4047265007995 and 4047265008013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4047265005053) 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, 2023632504026 + 2023632504027.
It is an arithmetic number, because the mean of its divisors is an integer number (2023632504027).
Almost surely, 24047265008053 is an apocalyptic number.
It is an amenable number.
4047265008053 is a deficient number, since it is larger than the sum of its proper divisors (1).
4047265008053 is an equidigital number, since it uses as much as digits as its factorization.
4047265008053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 806400, while the sum is 44.
The spelling of 4047265008053 in words is "four trillion, forty-seven billion, two hundred sixty-five million, eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •