Base | Representation |
---|---|
bin | 10111110011000101010000… |
… | …110010110110110100000011 |
3 | 111201120220201121222200102002 |
4 | 113303011100302312310003 |
5 | 102204314231331421334 |
6 | 1010334343250214215 |
7 | 31021553343023642 |
oct | 2763052062666403 |
9 | 451526647880362 |
10 | 104665413545219 |
11 | 3039339736300a |
12 | b8a4a3728436b |
13 | 4652ba1a5c647 |
14 | 1bbbb93c39359 |
15 | c178c323db7e |
hex | 5f3150cb6d03 |
104665413545219 has 12 divisors (see below), whose sum is σ = 109142837955360. Its totient is φ = 100359851893200.
The previous prime is 104665413545149. The next prime is 104665413545237. The reversal of 104665413545219 is 912545314566401.
It is not a de Polignac number, because 104665413545219 - 28 = 104665413544963 is a prime.
It is a super-2 number, since 2×1046654135452192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104665413548219) 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 11 ways as a sum of consecutive naturals, for example, 499496267 + ... + 499705764.
It is an arithmetic number, because the mean of its divisors is an integer number (9095236496280).
Almost surely, 2104665413545219 is an apocalyptic number.
104665413545219 is a deficient number, since it is larger than the sum of its proper divisors (4477424410141).
104665413545219 is an equidigital number, since it uses as much as digits as its factorization.
104665413545219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 999202202 (or 999202171 counting only the distinct ones).
The product of its (nonzero) digits is 15552000, while the sum is 56.
The spelling of 104665413545219 in words is "one hundred four trillion, six hundred sixty-five billion, four hundred thirteen million, five hundred forty-five thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •