Search a number
-
+
103706448649 = 1371182164037
BaseRepresentation
bin110000010010101100…
…0101101001100001001
3100220200110222102221121
41200211120231030021
53144342322324044
6115350405035241
710330641161146
oct1404530551411
9326613872847
10103706448649
113aa8864a901
12181230b5b21
139a1968061b
14503b3dd3cd
152a6e826984
hex182562d309

103706448649 has 8 divisors (see below), whose sum is σ = 104473898568. Its totient is φ = 102939150720.

The previous prime is 103706448647. The next prime is 103706448689. The reversal of 103706448649 is 946844607301.

It can be written as a sum of positive squares in 4 ways, for example, as 821395600 + 102885053049 = 28660^2 + 320757^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 103706448649 - 21 = 103706448647 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2103706448649 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 75995.

The product of its (nonzero) digits is 3483648, while the sum is 52.

The spelling of 103706448649 in words is "one hundred three billion, seven hundred six million, four hundred forty-eight thousand, six hundred forty-nine".

Divisors: 1 137 11821 64037 1619477 8773069 756981377 103706448649