Search a number
-
+
15097681 = 27155711
BaseRepresentation
bin111001100101…
…111101010001
31001102001010101
4321211331101
512331111211
61255332401
7242220364
oct71457521
931361111
1015097681
118582125
125081101
133187c51
1420100db
1514d35c1
hexe65f51

15097681 has 4 divisors (see below), whose sum is σ = 15153664. Its totient is φ = 15041700.

The previous prime is 15097679. The next prime is 15097711. The reversal of 15097681 is 18679051.

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 not a de Polignac number, because 15097681 - 21 = 15097679 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 15097681.

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

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

Almost surely, 215097681 is an apocalyptic number.

It is an amenable number.

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

15097681 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 55982.

The product of its (nonzero) digits is 15120, while the sum is 37.

The square root of 15097681 is about 3885.5734454518. The cubic root of 15097681 is about 247.1553874816.

The spelling of 15097681 in words is "fifteen million, ninety-seven thousand, six hundred eighty-one".

Divisors: 1 271 55711 15097681