Search a number
-
+
1069059463253 is a prime number
BaseRepresentation
bin11111000111010001110…
…10001101100001010101
310210012102120222122111022
433203220322031201111
5120003413210311003
62135041422250525
7140144201335025
oct17435072154125
93705376878438
101069059463253
11382427218871
12153235a26a45
1379a728c5872
1439a5818da85
151cc1e4de738
hexf8e8e8d855

1069059463253 has 2 divisors, whose sum is σ = 1069059463254. Its totient is φ = 1069059463252.

The previous prime is 1069059463237. The next prime is 1069059463271. The reversal of 1069059463253 is 3523649509601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1068200797444 + 858665809 = 1033538^2 + 29303^2 .

It is a cyclic number.

It is not a de Polignac number, because 1069059463253 - 24 = 1069059463237 is a prime.

It is a super-2 number, since 2×10690594632532 (a number of 25 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 1069059463195 and 1069059463204.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1069059463273) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534529731626 + 534529731627.

It is an arithmetic number, because the mean of its divisors is an integer number (534529731627).

Almost surely, 21069059463253 is an apocalyptic number.

It is an amenable number.

1069059463253 is a deficient number, since it is larger than the sum of its proper divisors (1).

1069059463253 is an equidigital number, since it uses as much as digits as its factorization.

1069059463253 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 5248800, while the sum is 53.

The spelling of 1069059463253 in words is "one trillion, sixty-nine billion, fifty-nine million, four hundred sixty-three thousand, two hundred fifty-three".