Base | Representation |
---|---|
bin | 100111010000101000… |
… | …100101111000110101 |
3 | 11000210212002021002121 |
4 | 213100220211320311 |
5 | 1142313140220131 |
6 | 31211000035541 |
7 | 3021432436423 |
oct | 472050457065 |
9 | 130725067077 |
10 | 42155007541 |
11 | 16972448109 |
12 | 8205762bb1 |
13 | 3c8a68cb5a |
14 | 207c896113 |
15 | 116acb7911 |
hex | 9d0a25e35 |
42155007541 has 4 divisors (see below), whose sum is σ = 42174699084. Its totient is φ = 42135316000.
The previous prime is 42155007529. The next prime is 42155007547. The reversal of 42155007541 is 14570055124.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 18075726916 + 24079280625 = 134446^2 + 155175^2 .
It is a cyclic number.
It is not a de Polignac number, because 42155007541 - 25 = 42155007509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42155007497 and 42155007506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42155007547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9842560 + ... + 9846841.
It is an arithmetic number, because the mean of its divisors is an integer number (10543674771).
Almost surely, 242155007541 is an apocalyptic number.
It is an amenable number.
42155007541 is a deficient number, since it is larger than the sum of its proper divisors (19691543).
42155007541 is a wasteful number, since it uses less digits than its factorization.
42155007541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19691542.
The product of its (nonzero) digits is 28000, while the sum is 34.
The spelling of 42155007541 in words is "forty-two billion, one hundred fifty-five million, seven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •