Base | Representation |
---|---|
bin | 10111110001010010110101… |
… | …001100110101001010111111 |
3 | 111201011011120122022022011102 |
4 | 113301102311030311022333 |
5 | 102200311112232234010 |
6 | 1010202103130043315 |
7 | 31006643461233131 |
oct | 2761226514651277 |
9 | 451134518268142 |
10 | 104542544024255 |
11 | 30346275757367 |
12 | b88506657953b |
13 | 464442021659c |
14 | 1bb5c59773051 |
15 | c145d13b9ba5 |
hex | 5f14b53352bf |
104542544024255 has 8 divisors (see below), whose sum is σ = 125451107912592. Its totient is φ = 83633998497088.
The previous prime is 104542544024231. The next prime is 104542544024267. The reversal of 104542544024255 is 552420445245401.
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 104542544024255 - 226 = 104542476915391 is a prime.
It is a super-2 number, since 2×1045425440242552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
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, 18440867 + ... + 23433963.
It is an arithmetic number, because the mean of its divisors is an integer number (15681388489074).
Almost surely, 2104542544024255 is an apocalyptic number.
104542544024255 is a deficient number, since it is larger than the sum of its proper divisors (20908563888337).
104542544024255 is an equidigital number, since it uses as much as digits as its factorization.
104542544024255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9180585.
The product of its (nonzero) digits is 5120000, while the sum is 47.
Adding to 104542544024255 its reverse (552420445245401), we get a palindrome (656962989269656).
The spelling of 104542544024255 in words is "one hundred four trillion, five hundred forty-two billion, five hundred forty-four million, twenty-four thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •