Base | Representation |
---|---|
bin | 10011101001100100100… |
… | …001101001111101000001 |
3 | 11210002101011111000100121 |
4 | 103221210201221331001 |
5 | 134110411401301022 |
6 | 2512153325420241 |
7 | 166361563650511 |
oct | 23514441517501 |
9 | 4702334430317 |
10 | 1350306275137 |
11 | 480730765296 |
12 | 199846a0a681 |
13 | 9a444451251 |
14 | 494d8843841 |
15 | 251d06182c7 |
hex | 13a64869f41 |
1350306275137 has 8 divisors (see below), whose sum is σ = 1423474560000. Its totient is φ = 1277347943664.
The previous prime is 1350306275093. The next prime is 1350306275207. The reversal of 1350306275137 is 7315726030531.
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 1350306275137 - 235 = 1315946536769 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1350306275093 and 1350306275102.
It is not an unprimeable number, because it can be changed into a prime (1350306273137) 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 7 ways as a sum of consecutive naturals, for example, 52475137 + ... + 52500862.
It is an arithmetic number, because the mean of its divisors is an integer number (177934320000).
Almost surely, 21350306275137 is an apocalyptic number.
It is an amenable number.
1350306275137 is a deficient number, since it is larger than the sum of its proper divisors (73168284863).
1350306275137 is a wasteful number, since it uses less digits than its factorization.
1350306275137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104976695.
The product of its (nonzero) digits is 396900, while the sum is 43.
The spelling of 1350306275137 in words is "one trillion, three hundred fifty billion, three hundred six million, two hundred seventy-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •