Search a number
-
+
1399170065 = 51999139987
BaseRepresentation
bin101001101100101…
…1010010000010001
310121111210012111112
41103121122100101
510331141420230
6350501023105
746446515006
oct12331322021
93544705445
101399170065
116588821a7
123306b4a95
13193b4aaa7
14d3b778ad
1582c7dd95
hex5365a411

1399170065 has 8 divisors (see below), whose sum is σ = 1679856000. Its totient is φ = 1118768112.

The previous prime is 1399170061. The next prime is 1399170079. The reversal of 1399170065 is 5600719931.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1399170065 - 22 = 1399170061 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59999 + ... + 79988.

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

Almost surely, 21399170065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 141991.

The product of its (nonzero) digits is 51030, while the sum is 41.

The square root of 1399170065 is about 37405.4817506739. The cubic root of 1399170065 is about 1118.4678414551.

Adding to 1399170065 its reverse (5600719931), we get a palindrome (6999889996).

The spelling of 1399170065 in words is "one billion, three hundred ninety-nine million, one hundred seventy thousand, sixty-five".

Divisors: 1 5 1999 9995 139987 699935 279834013 1399170065