Search a number
-
+
130948073410767 = 343649357803589
BaseRepresentation
bin11101110001100010111001…
…011001100101000011001111
3122011122111212101101200001020
4131301202321121211003033
5114130423123243121032
61142300414153245223
736403454221553514
oct3561427131450317
9564574771350036
10130948073410767
11387a68476a4068
121282a744a03813
13580b4728caa82
142449cc608930b
1510213d7258b2c
hex7718b96650cf

130948073410767 has 4 divisors (see below), whose sum is σ = 174597431214360. Its totient is φ = 87298715607176.

The previous prime is 130948073410751. The next prime is 130948073410811. The reversal of 130948073410767 is 767014370849031.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 130948073410767 - 24 = 130948073410751 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 130948073410767.

It is a congruent number.

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

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

Almost surely, 2130948073410767 is an apocalyptic number.

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

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

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

The sum of its prime factors is 43649357803592.

The product of its (nonzero) digits is 21337344, while the sum is 60.

The spelling of 130948073410767 in words is "one hundred thirty trillion, nine hundred forty-eight billion, seventy-three million, four hundred ten thousand, seven hundred sixty-seven".

Divisors: 1 3 43649357803589 130948073410767