Search a number
-
+
891314695353 = 31914115521911
BaseRepresentation
bin11001111100001100111…
…11101110110010111001
310011012122020211220002110
430332012133232302321
5104100403030222403
61521244143122533
7121252415622435
oct14760637566271
93135566756073
10891314695353
113140059aa975
121248ab5a3449
13660872806a4
14311d5acb9c5
15182b9cb3103
hexcf867eecb9

891314695353 has 8 divisors (see below), whose sum is σ = 1188481758016. Its totient is φ = 594178714800.

The previous prime is 891314695351. The next prime is 891314695363. The reversal of 891314695353 is 353596413198.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 891314695353 - 21 = 891314695351 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7703533 + ... + 7818378.

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

Almost surely, 2891314695353 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15541055.

The product of its digits is 10497600, while the sum is 57.

The spelling of 891314695353 in words is "eight hundred ninety-one billion, three hundred fourteen million, six hundred ninety-five thousand, three hundred fifty-three".

Divisors: 1 3 19141 57423 15521911 46565733 297104898451 891314695353