Base | Representation |
---|---|
bin | 10011110010000001011… |
… | …110010100000010100111 |
3 | 11210221210122211010212122 |
4 | 103302001132110002213 |
5 | 134233003224412212 |
6 | 2520254051140155 |
7 | 200132515161110 |
oct | 23620136240247 |
9 | 4727718733778 |
10 | 1359381872807 |
11 | 4845686a0132 |
12 | 19b55a2a465b |
13 | 9b25c77cb9a |
14 | 49b19cd7207 |
15 | 25562279272 |
hex | 13c817940a7 |
1359381872807 has 8 divisors (see below), whose sum is σ = 1557635629056. Its totient is φ = 1162142203032.
The previous prime is 1359381872749. The next prime is 1359381872813. The reversal of 1359381872807 is 7082781839531.
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 1359381872807 - 214 = 1359381856423 is a prime.
It is a super-2 number, since 2×13593818728072 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1359381872807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1359381872887) 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, 253518743 + ... + 253524104.
It is an arithmetic number, because the mean of its divisors is an integer number (194704453632).
Almost surely, 21359381872807 is an apocalyptic number.
1359381872807 is a deficient number, since it is larger than the sum of its proper divisors (198253756249).
1359381872807 is an equidigital number, since it uses as much as digits as its factorization.
1359381872807 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 507043237.
The product of its (nonzero) digits is 20321280, while the sum is 62.
The spelling of 1359381872807 in words is "one trillion, three hundred fifty-nine billion, three hundred eighty-one million, eight hundred seventy-two thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •