Search a number
-
+
15630947 is a prime number
BaseRepresentation
bin111011101000…
…001001100011
31002102010121222
4323220021203
513000142242
61315005255
7246601163
oct73501143
932363558
1015630947
118906842
12529982b
1333138a7
14210c5a3
15158b5d2
hexee8263

15630947 has 2 divisors, whose sum is σ = 15630948. Its totient is φ = 15630946.

The previous prime is 15630943. The next prime is 15630949. The reversal of 15630947 is 74903651.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 15630947 - 22 = 15630943 is a prime.

Together with 15630949, it forms a pair of twin primes.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (15630943) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7815473 + 7815474.

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

Almost surely, 215630947 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 22680, while the sum is 35.

The square root of 15630947 is about 3953.5992462565. The cubic root of 15630947 is about 250.0317133102.

The spelling of 15630947 in words is "fifteen million, six hundred thirty thousand, nine hundred forty-seven".