Search a number
-
+
3093939760970 = 25309393976097
BaseRepresentation
bin101101000001011101001…
…011100010111101001010
3101221202222222111120121102
4231001131023202331022
5401142342034322340
610325200350341402
7436346466023162
oct55013513427512
911852888446542
103093939760970
11a93150377573
1241b7621ba862
131959ac941b96
14a9a671475a2
15557318e7215
hex2d05d2e2f4a

3093939760970 has 8 divisors (see below), whose sum is σ = 5569091569764. Its totient is φ = 1237575904384.

The previous prime is 3093939760969. The next prime is 3093939760987. The reversal of 3093939760970 is 790679393903.

3093939760970 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 3079080882361 + 14858878609 = 1754731^2 + 121897^2 .

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

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

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

It is an unprimeable number.

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

Almost surely, 23093939760970 is an apocalyptic number.

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

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

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

The sum of its prime factors is 309393976104.

The product of its (nonzero) digits is 52081218, while the sum is 65.

The spelling of 3093939760970 in words is "three trillion, ninety-three billion, nine hundred thirty-nine million, seven hundred sixty thousand, nine hundred seventy".

Divisors: 1 2 5 10 309393976097 618787952194 1546969880485 3093939760970