Base | Representation |
---|---|
bin | 10011000000110000001… |
… | …111110000011011110101 |
3 | 11121220020210122220020210 |
4 | 103000300033300123311 |
5 | 132401132222314101 |
6 | 2440104405420033 |
7 | 163250531322150 |
oct | 23006017603365 |
9 | 4556223586223 |
10 | 1306479494901 |
11 | 464090684659 |
12 | 19125540a619 |
13 | 9627b618ca9 |
14 | 4733bd32c97 |
15 | 23eb7bc57d6 |
hex | 130303f06f5 |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •