Search a number
-
+
104013210301 = 71113103909301
BaseRepresentation
bin110000011011110101…
…0111010001010111101
3100221110212012112211021
41200313222322022331
53201004340212201
6115441044024141
710341354462040
oct1406752721275
9327425175737
10104013210301
1140125822430
12181a9992051
139a680a7cb0
14506a052c57
152a8b71dea1
hex1837aba2bd

104013210301 has 16 divisors (see below), whose sum is σ = 139654101888. Its totient is φ = 74814696000.

The previous prime is 104013210241. The next prime is 104013210307. The reversal of 104013210301 is 103012310401.

It is not a de Polignac number, because 104013210301 - 213 = 104013202109 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51953650 + ... + 51955651.

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

Almost surely, 2104013210301 is an apocalyptic number.

104013210301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 103909332.

The product of its (nonzero) digits is 72, while the sum is 16.

Adding to 104013210301 its reverse (103012310401), we get a palindrome (207025520702).

The spelling of 104013210301 in words is "one hundred four billion, thirteen million, two hundred ten thousand, three hundred one".

Divisors: 1 7 11 13 77 91 143 1001 103909301 727365107 1143002311 1350820913 8001016177 9455746391 14859030043 104013210301