Base | Representation |
---|---|
bin | 10011010110010111101000… |
… | …00011101110011001000111 |
3 | 12120122202002111022001021221 |
4 | 21223023310003232121013 |
5 | 21034114440401320320 |
6 | 230255115133221211 |
7 | 11651065446664060 |
oct | 1153136403563107 |
9 | 176582074261257 |
10 | 42550040651335 |
11 | 12615409741348 |
12 | 4932596631807 |
13 | 1a985b4280759 |
14 | a7160c061567 |
15 | 4dbc56a523aa |
hex | 26b2f40ee647 |
42550040651335 has 8 divisors (see below), whose sum is σ = 58354341464736. Its totient is φ = 29177170732320.
The previous prime is 42550040651309. The next prime is 42550040651341. The reversal of 42550040651335 is 53315604005524.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42550040651335 - 25 = 42550040651303 is a prime.
It is a super-2 number, since 2×425500406513352 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42550040651291 and 42550040651300.
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, 607857723556 + ... + 607857723625.
It is an arithmetic number, because the mean of its divisors is an integer number (7294292683092).
Almost surely, 242550040651335 is an apocalyptic number.
42550040651335 is a deficient number, since it is larger than the sum of its proper divisors (15804300813401).
42550040651335 is a wasteful number, since it uses less digits than its factorization.
42550040651335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1215715447193.
The product of its (nonzero) digits is 1080000, while the sum is 43.
Adding to 42550040651335 its reverse (53315604005524), we get a palindrome (95865644656859).
The spelling of 42550040651335 in words is "forty-two trillion, five hundred fifty billion, forty million, six hundred fifty-one thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •