Search a number
-
+
1308630151981 = 4727843194723
BaseRepresentation
bin10011000010110000011…
…011110111001100101101
311122002210200111121010201
4103002300123313030231
5132420033304330411
62441102033433501
7163355034521335
oct23026033671455
94562720447121
101308630151981
11464a946720a9
1219175570b891
1396532062349
14474a38080c5
15240918e73c1
hex130b06f732d

1308630151981 has 4 divisors (see below), whose sum is σ = 1336473346752. Its totient is φ = 1280786957212.

The previous prime is 1308630151973. The next prime is 1308630151987. The reversal of 1308630151981 is 1891510368031.

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 1308630151981 - 23 = 1308630151973 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 21308630151981 is an apocalyptic number.

It is an amenable number.

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

1308630151981 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 27843194770.

The product of its (nonzero) digits is 155520, while the sum is 46.

The spelling of 1308630151981 in words is "one trillion, three hundred eight billion, six hundred thirty million, one hundred fifty-one thousand, nine hundred eighty-one".

Divisors: 1 47 27843194723 1308630151981