Base | Representation |
---|---|
bin | 10100001100100101110… |
… | …100001000111011100011 |
3 | 11220200102202101022211121 |
4 | 110030211310020323203 |
5 | 140214414132033132 |
6 | 2541332503353111 |
7 | 202162450446616 |
oct | 24144564107343 |
9 | 4820382338747 |
10 | 1387908861667 |
11 | 495677408089 |
12 | 1a4b9ba52797 |
13 | a0b57912253 |
14 | 4b26486617d |
15 | 261818da497 |
hex | 14325d08ee3 |
1387908861667 has 8 divisors (see below), whose sum is σ = 1390213255680. Its totient is φ = 1385606181960.
The previous prime is 1387908861641. The next prime is 1387908861839. The reversal of 1387908861667 is 7661688097831.
It is a happy number.
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 1387908861667 - 239 = 838153047779 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1387908861596 and 1387908861605.
It is not an unprimeable number, because it can be changed into a prime (1387908861617) 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, 1197084 + ... + 2051542.
It is an arithmetic number, because the mean of its divisors is an integer number (173776656960).
Almost surely, 21387908861667 is an apocalyptic number.
1387908861667 is a deficient number, since it is larger than the sum of its proper divisors (2304394013).
1387908861667 is an equidigital number, since it uses as much as digits as its factorization.
1387908861667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857153.
The product of its (nonzero) digits is 146313216, while the sum is 70.
The spelling of 1387908861667 in words is "one trillion, three hundred eighty-seven billion, nine hundred eight million, eight hundred sixty-one thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •