Search a number
-
+
1013487709 = 13233389591
BaseRepresentation
bin111100011010001…
…001100001011101
32121122001111202211
4330122021201131
54033423101314
6244322320421
734054334443
oct7432114135
92548044684
101013487709
114800a6353
122434b9111
13131c80390
149885cb93
155de979c4
hex3c68985d

1013487709 has 8 divisors (see below), whose sum is σ = 1138902912. Its totient is φ = 894851760.

The previous prime is 1013487703. The next prime is 1013487773. The reversal of 1013487709 is 9077843101.

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

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 1013487709 - 23 = 1013487701 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 21013487709 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3389627.

The product of its (nonzero) digits is 42336, while the sum is 40.

The square root of 1013487709 is about 31835.3217197502. The cubic root of 1013487709 is about 1004.4758399682.

The spelling of 1013487709 in words is "one billion, thirteen million, four hundred eighty-seven thousand, seven hundred nine".

Divisors: 1 13 23 299 3389591 44064683 77960593 1013487709