Search a number
-
+
93994765201 = 607154851343
BaseRepresentation
bin101011110001010000…
…1100100101110010001
322222121122201210210001
41113202201210232101
53020000124441301
6111103002010001
76535164215221
oct1274241445621
9288548653701
1093994765201
113695465a337
12162727a6901
138b2c63007c
14479968c081
1526a1e1ac01
hex15e2864b91

93994765201 has 4 divisors (see below), whose sum is σ = 94149617152. Its totient is φ = 93839913252.

The previous prime is 93994765177. The next prime is 93994765213. The reversal of 93994765201 is 10256749939.

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 93994765201 - 211 = 93994763153 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (93994763201) 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, 77425065 + ... + 77426278.

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

Almost surely, 293994765201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 154851950.

The product of its (nonzero) digits is 3674160, while the sum is 55.

The spelling of 93994765201 in words is "ninety-three billion, nine hundred ninety-four million, seven hundred sixty-five thousand, two hundred one".

Divisors: 1 607 154851343 93994765201