Search a number
-
+
10015322014 = 215113314137
BaseRepresentation
bin10010101001111010…
…11010111110011110
3221211222121001222101
421110331122332132
5131002410301024
64333451035314
7503121555355
oct112475327636
927758531871
1010015322014
11427a42a735
121b3613bb3a
13c37c23559
146b01d099c
153d93d7c44
hex254f5af9e

10015322014 has 8 divisors (see below), whose sum is σ = 15032929968. Its totient is φ = 5004345360.

The previous prime is 10015322011. The next prime is 10015322059. The reversal of 10015322014 is 41022351001.

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

It is a super-2 number, since 2×100153220142 (a number of 21 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 10015321982 and 10015322000.

It is a congruent number.

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

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

Almost surely, 210015322014 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3315650.

The product of its (nonzero) digits is 240, while the sum is 19.

Adding to 10015322014 its reverse (41022351001), we get a palindrome (51037673015).

The spelling of 10015322014 in words is "ten billion, fifteen million, three hundred twenty-two thousand, fourteen".

Divisors: 1 2 1511 3022 3314137 6628274 5007661007 10015322014