Base | Representation |
---|---|
bin | 10011110100000001011… |
… | …001101010111011000001 |
3 | 11211011100020101210020001 |
4 | 103310001121222323001 |
5 | 134301402200430312 |
6 | 2521251041120001 |
7 | 200236636143223 |
oct | 23640131527301 |
9 | 4734306353201 |
10 | 1361528139457 |
11 | 48546a15a022 |
12 | 19ba59029001 |
13 | 9b512319a55 |
14 | 49c80d88413 |
15 | 2563a8d0057 |
hex | 13d0166aec1 |
1361528139457 has 8 divisors (see below), whose sum is σ = 1375317328032. Its totient is φ = 1347758666400.
The previous prime is 1361528139443. The next prime is 1361528139527. The reversal of 1361528139457 is 7549318251631.
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 1361528139457 - 219 = 1361527615169 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1361528139398 and 1361528139407.
It is not an unprimeable number, because it can be changed into a prime (1361528139407) 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, 4790044 + ... + 5066317.
It is an arithmetic number, because the mean of its divisors is an integer number (171914666004).
Almost surely, 21361528139457 is an apocalyptic number.
It is an amenable number.
1361528139457 is a deficient number, since it is larger than the sum of its proper divisors (13789188575).
1361528139457 is a wasteful number, since it uses less digits than its factorization.
1361528139457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9857759.
The product of its digits is 5443200, while the sum is 55.
The spelling of 1361528139457 in words is "one trillion, three hundred sixty-one billion, five hundred twenty-eight million, one hundred thirty-nine thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •