Search a number
-
+
926027131 is a prime number
BaseRepresentation
bin110111001100100…
…000110101111011
32101112111001102011
4313030200311323
53344030332011
6231515550351
731643046361
oct6714406573
92345431364
10926027131
11435799987
1221a15b3b7
13119b0a263
148adb3631
155646d621
hex37320d7b

926027131 has 2 divisors, whose sum is σ = 926027132. Its totient is φ = 926027130.

The previous prime is 926027117. The next prime is 926027143. The reversal of 926027131 is 131720629.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 926027131 - 223 = 917638523 is a prime.

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

It is a pancake number, because a pancake can be divided into 926027131 parts by 43035 straight cuts.

It is equal to p47271460 and since 926027131 and 47271460 have the same sum of digits, it is a Honaker prime.

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

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

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

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

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

Almost surely, 2926027131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4536, while the sum is 31.

The square root of 926027131 is about 30430.6938961306. The cubic root of 926027131 is about 974.7080891624.

The spelling of 926027131 in words is "nine hundred twenty-six million, twenty-seven thousand, one hundred thirty-one".