Search a number
-
+
126951957 = 32111282343
BaseRepresentation
bin1111001000100…
…10001000010101
322211212211100100
413210102020111
5224444430312
620333004313
73101034216
oct744221025
9284784310
10126951957
116572a980
1236623699
13203bc302
1412c0940d
15b22a5dc
hex7912215

126951957 has 12 divisors (see below), whose sum is σ = 200045664. Its totient is φ = 76940520.

The previous prime is 126951931. The next prime is 126951959. The reversal of 126951957 is 759159621.

126951957 is a `hidden beast` number, since 126 + 9 + 519 + 5 + 7 = 666.

It is not a de Polignac number, because 126951957 - 28 = 126951701 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2126951957 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its digits is 170100, while the sum is 45.

The square root of 126951957 is about 11267.2959045194. The cubic root of 126951957 is about 502.5891784995.

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

Divisors: 1 3 9 11 33 99 1282343 3847029 11541087 14105773 42317319 126951957