Search a number
-
+
1363265625453 = 3454421875151
BaseRepresentation
bin10011110101101000111…
…101101001110101101101
311211022211022210012221020
4103311220331221311231
5134313432000003303
62522135305324353
7200330664423114
oct23655075516555
94738738705836
101363265625453
114861809a5a66
121a0262a966b9
139b72b28c784
1449da7a2ac7b
15256dd1daa53
hex13d68f69d6d

1363265625453 has 4 divisors (see below), whose sum is σ = 1817687500608. Its totient is φ = 908843750300.

The previous prime is 1363265625389. The next prime is 1363265625521. The reversal of 1363265625453 is 3545265623631.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1363265625453 - 26 = 1363265625389 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1363265625053) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 227210937573 + ... + 227210937578.

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

Almost surely, 21363265625453 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 454421875154.

The product of its digits is 11664000, while the sum is 51.

The spelling of 1363265625453 in words is "one trillion, three hundred sixty-three billion, two hundred sixty-five million, six hundred twenty-five thousand, four hundred fifty-three".

Divisors: 1 3 454421875151 1363265625453