Base | Representation |
---|---|
bin | 10100001011101000011… |
… | …111110110010001111011 |
3 | 11220120210001122110022221 |
4 | 110023220133312101323 |
5 | 140210312303212334 |
6 | 2541042434224511 |
7 | 202125116421451 |
oct | 24135037662173 |
9 | 4816701573287 |
10 | 1386880132219 |
11 | 49519975145a |
12 | 1a4953425137 |
13 | a0a227564ba |
14 | 4b1a7d9a9d1 |
15 | 261214318b4 |
hex | 142e87f647b |
1386880132219 has 4 divisors (see below), whose sum is σ = 1406413655280. Its totient is φ = 1367346609160.
The previous prime is 1386880132159. The next prime is 1386880132243. The reversal of 1386880132219 is 9122310886831.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1386880132219 - 217 = 1386880001147 is a prime.
It is a super-2 number, since 2×13868801322192 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1386880132019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9766761424 + ... + 9766761565.
It is an arithmetic number, because the mean of its divisors is an integer number (351603413820).
Almost surely, 21386880132219 is an apocalyptic number.
1386880132219 is a deficient number, since it is larger than the sum of its proper divisors (19533523061).
1386880132219 is an equidigital number, since it uses as much as digits as its factorization.
1386880132219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19533523060.
The product of its (nonzero) digits is 995328, while the sum is 52.
The spelling of 1386880132219 in words is "one trillion, three hundred eighty-six billion, eight hundred eighty million, one hundred thirty-two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •