Search a number
-
+
1355967069 = 3451989023
BaseRepresentation
bin101000011010010…
…0110101001011101
310111111111021010120
41100310212221131
510234111421234
6342315025153
745413346522
oct12064465135
93444437116
101355967069
11636454146
1231a13b1b9
13187c023a2
14cc12d149
157e098049
hex50d26a5d

1355967069 has 4 divisors (see below), whose sum is σ = 1807956096. Its totient is φ = 903978044.

The previous prime is 1355967037. The next prime is 1355967071. The reversal of 1355967069 is 9607695531.

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 1355967069 - 25 = 1355967037 is a prime.

It is a super-2 number, since 2×13559670692 = 3677293384424901522, which contains 22 as substring.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 21355967069 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 451989026.

The product of its (nonzero) digits is 1530900, while the sum is 51.

The square root of 1355967069 is about 36823.4581347271. The cubic root of 1355967069 is about 1106.8354170721.

The spelling of 1355967069 in words is "one billion, three hundred fifty-five million, nine hundred sixty-seven thousand, sixty-nine".

Divisors: 1 3 451989023 1355967069