Search a number
-
+
15010105 = 511272911
BaseRepresentation
bin111001010000…
…100100111001
31001020120222211
4321100210321
512320310410
61253415121
7241404145
oct71204471
931216884
1015010105
118522350
12503a4a1
133157126
141dca225
1514b768a
hexe50939

15010105 has 8 divisors (see below), whose sum is σ = 19649664. Its totient is φ = 10916400.

The previous prime is 15010103. The next prime is 15010109. The reversal of 15010105 is 50101051.

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

It is not a de Polignac number, because 15010105 - 21 = 15010103 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 215010105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 272927.

The product of its (nonzero) digits is 25, while the sum is 13.

The square root of 15010105 is about 3874.2876764639. The cubic root of 15010105 is about 246.6765751640.

Adding to 15010105 its reverse (50101051), we get a palindrome (65111156).

The spelling of 15010105 in words is "fifteen million, ten thousand, one hundred five".

Divisors: 1 5 11 55 272911 1364555 3002021 15010105