Base | Representation |
---|---|
bin | 10111101100111101010010… |
… | …110010101001110011000111 |
3 | 111200002200101020122010011121 |
4 | 113230331102302221303013 |
5 | 102130420304301020320 |
6 | 1005413140343014411 |
7 | 30646263613036501 |
oct | 2754752262516307 |
9 | 450080336563147 |
10 | 104244540251335 |
11 | 30240952360010 |
12 | b83735973a407 |
13 | 46222aab40943 |
14 | 1ba56697c6d71 |
15 | c0b98e0c58aa |
hex | 5ecf52ca9cc7 |
104244540251335 has 8 divisors (see below), whose sum is σ = 136465579965456. Its totient is φ = 75814211091840.
The previous prime is 104244540251303. The next prime is 104244540251353. The reversal of 104244540251335 is 533152045442401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104244540251335 - 25 = 104244540251303 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104244540251291 and 104244540251300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 947677638594 + ... + 947677638703.
It is an arithmetic number, because the mean of its divisors is an integer number (17058197495682).
Almost surely, 2104244540251335 is an apocalyptic number.
104244540251335 is a deficient number, since it is larger than the sum of its proper divisors (32221039714121).
104244540251335 is a wasteful number, since it uses less digits than its factorization.
104244540251335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1895355277313.
The product of its (nonzero) digits is 1152000, while the sum is 43.
Adding to 104244540251335 its reverse (533152045442401), we get a palindrome (637396585693736).
The spelling of 104244540251335 in words is "one hundred four trillion, two hundred forty-four billion, five hundred forty million, two hundred fifty-one thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •