Search a number
-
+
40957465969 = 75851066567
BaseRepresentation
bin100110001001010000…
…010101010101110001
310220201101200211220001
4212021100111111301
51132340102402334
630452100350001
72646651500530
oct461120252561
9126641624801
1040957465969
1116408470432
127b306a5301
133b29549684
141da7806317
1510eaab5714
hex989415571

40957465969 has 4 divisors (see below), whose sum is σ = 46808532544. Its totient is φ = 35106399396.

The previous prime is 40957465937. The next prime is 40957465973. The reversal of 40957465969 is 96956475904.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 40957465969 - 25 = 40957465937 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 40957465969.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2925533277 + ... + 2925533290.

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

Almost surely, 240957465969 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5851066574.

The product of its (nonzero) digits is 73483200, while the sum is 64.

The spelling of 40957465969 in words is "forty billion, nine hundred fifty-seven million, four hundred sixty-five thousand, nine hundred sixty-nine".

Divisors: 1 7 5851066567 40957465969