Search a number
-
+
3245011135553 = 11295001012323
BaseRepresentation
bin101111001110001001101…
…111000110110001000001
3102111012221101221120010002
4233032021233012301001
5411131240322314203
610522423150245345
7453305254355405
oct57161157066101
912435841846102
103245011135553
111041224209260
12444aa37b6855
131a700715b8a5
14b30b8d05105
15596245a5d88
hex2f389bc6c41

3245011135553 has 4 divisors (see below), whose sum is σ = 3540012147888. Its totient is φ = 2950010123220.

The previous prime is 3245011135529. The next prime is 3245011135603. The reversal of 3245011135553 is 3555311105423.

3245011135553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 3245011135553 - 220 = 3245010086977 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (3245011135523) 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, 147500506151 + ... + 147500506172.

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

Almost surely, 23245011135553 is an apocalyptic number.

It is an amenable number.

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

3245011135553 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 295001012334.

The product of its (nonzero) digits is 135000, while the sum is 38.

The spelling of 3245011135553 in words is "three trillion, two hundred forty-five billion, eleven million, one hundred thirty-five thousand, five hundred fifty-three".

Divisors: 1 11 295001012323 3245011135553