Search a number
-
+
694091146001 = 1163099195091
BaseRepresentation
bin10100001100110110000…
…11100110001100010001
32110100120101221111212112
422012123003212030101
542332444313133001
61250505554035105
7101101140252641
oct12063303461421
92410511844775
10694091146001
112483a93a2190
12b2629878a95
13505b6234926
1425846660521
15130c5475cbb
hexa19b0e6311

694091146001 has 4 divisors (see below), whose sum is σ = 757190341104. Its totient is φ = 630991950900.

The previous prime is 694091145991. The next prime is 694091146013. The reversal of 694091146001 is 100641190496.

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 694091146001 - 222 = 694086951697 is a prime.

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 694091146001.

It is not an unprimeable number, because it can be changed into a prime (694091146081) 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 3 ways as a sum of consecutive naturals, for example, 31549597535 + ... + 31549597556.

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

Almost surely, 2694091146001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 63099195102.

The product of its (nonzero) digits is 46656, while the sum is 41.

The spelling of 694091146001 in words is "six hundred ninety-four billion, ninety-one million, one hundred forty-six thousand, one".

Divisors: 1 11 63099195091 694091146001