Search a number
-
+
1513066601 = 10314689967
BaseRepresentation
bin101101000101111…
…1001000001101001
310220110002202011202
41122023321001221
511044321112401
6410050133545
752331565614
oct13213710151
93813082152
101513066601
117070a5372
123628812b5
131b16188a7
14104d4517b
158cc7b06b
hex5a2f9069

1513066601 has 4 divisors (see below), whose sum is σ = 1527756672. Its totient is φ = 1498376532.

The previous prime is 1513066591. The next prime is 1513066603. The reversal of 1513066601 is 1066603151.

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 a de Polignac number, because none of the positive numbers 2k-1513066601 is a prime.

It is a Duffinian number.

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

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

Almost surely, 21513066601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14690070.

The product of its (nonzero) digits is 3240, while the sum is 29.

The square root of 1513066601 is about 38898.1567815237. The cubic root of 1513066601 is about 1148.0285317181.

Adding to 1513066601 its reverse (1066603151), we get a palindrome (2579669752).

The spelling of 1513066601 in words is "one billion, five hundred thirteen million, sixty-six thousand, six hundred one".

Divisors: 1 103 14689967 1513066601