Base | Representation |
---|---|
bin | 10100001100100000101… |
… | …101000010000111101101 |
3 | 11220200012210000211100101 |
4 | 110030200231002013231 |
5 | 140214230204101220 |
6 | 2541320201431101 |
7 | 202160356550602 |
oct | 24144055020755 |
9 | 4820183024311 |
10 | 1387823112685 |
11 | 495632a6a659 |
12 | 1a4b7719b491 |
13 | a0b42c1b1c9 |
14 | 4b2573046a9 |
15 | 261790ed30a |
hex | 14320b421ed |
1387823112685 has 4 divisors (see below), whose sum is σ = 1665387735228. Its totient is φ = 1110258490144.
The previous prime is 1387823112631. The next prime is 1387823112719. The reversal of 1387823112685 is 5862113287831.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1109944424521 + 277878688164 = 1053539^2 + 527142^2 .
It is a cyclic number.
It is not a de Polignac number, because 1387823112685 - 29 = 1387823112173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138782311264 + ... + 138782311273.
It is an arithmetic number, because the mean of its divisors is an integer number (416346933807).
Almost surely, 21387823112685 is an apocalyptic number.
It is an amenable number.
1387823112685 is a deficient number, since it is larger than the sum of its proper divisors (277564622543).
1387823112685 is an equidigital number, since it uses as much as digits as its factorization.
1387823112685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277564622542.
The product of its digits is 3870720, while the sum is 55.
The spelling of 1387823112685 in words is "one trillion, three hundred eighty-seven billion, eight hundred twenty-three million, one hundred twelve thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •