Search a number
-
+
949272750769 = 7243450532867
BaseRepresentation
bin11011101000001010001…
…00001010101010110001
310100202020110011011110111
431310011010022222301
5111023102311011034
62004031225301321
7125403602151100
oct15640504125261
93322213134414
10949272750769
113366477a1822
12133b85634841
136b692968835
1433d332c8037
1519a5d11a364
hexdd0510aab1

949272750769 has 12 divisors (see below), whose sum is σ = 1129936432944. Its totient is φ = 794739975624.

The previous prime is 949272750749. The next prime is 949272750793. The reversal of 949272750769 is 967057272949.

It is not a de Polignac number, because 949272750769 - 227 = 949138533041 is a prime.

It is a super-2 number, since 2×9492727507692 (a number of 25 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (949272750709) 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 in 11 ways as a sum of consecutive naturals, for example, 225264327 + ... + 225268540.

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

Almost surely, 2949272750769 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 120022560, while the sum is 67.

The spelling of 949272750769 in words is "nine hundred forty-nine billion, two hundred seventy-two million, seven hundred fifty thousand, seven hundred sixty-nine".

Divisors: 1 7 43 49 301 2107 450532867 3153730069 19372913281 22076110483 135610392967 949272750769