Search a number
-
+
10130301110133 = 326449917451263
BaseRepresentation
bin1001001101101010010011…
…1111111100011101110101
31022212110002002202110220100
42103122210333330131311
52311433324041011013
633313443542024313
72063614206453621
oct223324477743565
938773062673810
1010130301110133
1132562669756a6
1211773a1418099
1358638b529219
142704485ba181
151287a4434473
hex936a4ffc775

10130301110133 has 12 divisors (see below), whose sum is σ = 14632884864000. Its totient is φ = 6753428978856.

The previous prime is 10130301110113. The next prime is 10130301110147. The reversal of 10130301110133 is 33101110303101.

It is not a de Polignac number, because 10130301110133 - 216 = 10130301044597 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8145141 + ... + 9306122.

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

Almost surely, 210130301110133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17515768 (or 17515765 counting only the distinct ones).

The product of its (nonzero) digits is 81, while the sum is 18.

Adding to 10130301110133 its reverse (33101110303101), we get a palindrome (43231411413234).

The spelling of 10130301110133 in words is "ten trillion, one hundred thirty billion, three hundred one million, one hundred ten thousand, one hundred thirty-three".

Divisors: 1 3 9 64499 193497 580491 17451263 52353789 157061367 1125589012237 3376767036711 10130301110133