Search a number
-
+
15130701 = 3216710067
BaseRepresentation
bin111001101110…
…000001001101
31001110201102100
4321232001031
512333140301
61300145313
7242415555
oct71560115
931421370
1015130701
1185a4a13
125098239
133199ca1
14201c165
1514dd286
hexe6e04d

15130701 has 12 divisors (see below), whose sum is σ = 21988512. Its totient is φ = 10025736.

The previous prime is 15130699. The next prime is 15130723. The reversal of 15130701 is 10703151.

It is a happy number.

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

It is not a de Polignac number, because 15130701 - 21 = 15130699 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3531 + ... + 6536.

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

Almost surely, 215130701 is an apocalyptic number.

It is an amenable number.

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

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

15130701 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 10240 (or 10237 counting only the distinct ones).

The product of its (nonzero) digits is 105, while the sum is 18.

The square root of 15130701 is about 3889.8201757922. The cubic root of 15130701 is about 247.3354400439.

Adding to 15130701 its reverse (10703151), we get a palindrome (25833852).

The spelling of 15130701 in words is "fifteen million, one hundred thirty thousand, seven hundred one".

Divisors: 1 3 9 167 501 1503 10067 30201 90603 1681189 5043567 15130701