Search a number
-
+
1306479494901 = 37193274384699
BaseRepresentation
bin10011000000110000001…
…111110000011011110101
311121220020210122220020210
4103000300033300123311
5132401132222314101
62440104405420033
7163250531322150
oct23006017603365
94556223586223
101306479494901
11464090684659
1219125540a619
139627b618ca9
144733bd32c97
1523eb7bc57d6
hex130303f06f5

1306479494901 has 16 divisors (see below), whose sum is σ = 2095606208000. Its totient is φ = 707267094768.

The previous prime is 1306479494897. The next prime is 1306479494909. The reversal of 1306479494901 is 1094949746031.

It is not a de Polignac number, because 1306479494901 - 22 = 1306479494897 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (57).

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21306479494901 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3274384728.

The product of its (nonzero) digits is 5878656, while the sum is 57.

The spelling of 1306479494901 in words is "one trillion, three hundred six billion, four hundred seventy-nine million, four hundred ninety-four thousand, nine hundred one".

Divisors: 1 3 7 19 21 57 133 399 3274384699 9823154097 22920692893 62213309281 68762078679 186639927843 435493164967 1306479494901