Search a number
-
+
130201111023 = 361711481481
BaseRepresentation
bin111100101000010010…
…1110100100111101111
3110110001221100202002020
41321100211310213233
54113122441023043
6135451421401223
712256335116604
oct1712045644757
9413057322066
10130201111023
1150244150895
1221298109213
13c37c75a739
14643209a6ab
1535c083be83
hex1e509749ef

130201111023 has 8 divisors (see below), whose sum is σ = 176447407536. Its totient is φ = 85377777600.

The previous prime is 130201110979. The next prime is 130201111031. The reversal of 130201111023 is 320111102031.

It is a happy number.

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

It is not a de Polignac number, because 130201111023 - 29 = 130201110511 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 355740558 + ... + 355740923.

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

Almost surely, 2130201111023 is an apocalyptic number.

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

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

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

The sum of its prime factors is 711481545.

The product of its (nonzero) digits is 36, while the sum is 15.

Adding to 130201111023 its reverse (320111102031), we get a palindrome (450312213054).

The spelling of 130201111023 in words is "one hundred thirty billion, two hundred one million, one hundred eleven thousand, twenty-three".

Divisors: 1 3 61 183 711481481 2134444443 43400370341 130201111023