Search a number
-
+
1409095959551 = 72225671274297
BaseRepresentation
bin10100100000010100101…
…010100000001111111111
311222201010022122102020122
4110200110222200033333
5141041312031201201
62555155120405155
7203542466014400
oct24402452401777
94881108572218
101409095959551
114a3659a30335
121a91134767bb
13a2b53214867
144c2b467d9a7
15269c1993e1b
hex14814aa03ff

1409095959551 has 12 divisors (see below), whose sum is σ = 1639226364048. Its totient is φ = 1207742068512.

The previous prime is 1409095959547. The next prime is 1409095959589. The reversal of 1409095959551 is 1559595909041.

It is not a de Polignac number, because 1409095959551 - 22 = 1409095959547 is a prime.

It is a super-4 number, since 4×14090959595514 (a number of 50 digits) contains 4444 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 21409095959551 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 16402500, while the sum is 62.

The spelling of 1409095959551 in words is "one trillion, four hundred nine billion, ninety-five million, nine hundred fifty-nine thousand, five hundred fifty-one".

Divisors: 1 7 49 22567 157969 1105783 1274297 8920079 62440553 28757060399 201299422793 1409095959551