Search a number
-
+
36948047 is a prime number
BaseRepresentation
bin1000110011110…
…0100001001111
32120112011012012
42030330201033
533424314142
63355531435
7626024153
oct214744117
976464165
1036948047
1119946684
1210459b7b
137868666
144c9b063
15339c882
hex233c84f

36948047 has 2 divisors, whose sum is σ = 36948048. Its totient is φ = 36948046.

The previous prime is 36948019. The next prime is 36948061. The reversal of 36948047 is 74084963.

36948047 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 36948047 - 28 = 36947791 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 236948047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 145152, while the sum is 41.

The square root of 36948047 is about 6078.4905198577. The cubic root of 36948047 is about 333.0661491172.

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