Base | Representation |
---|---|
bin | 100111100110000011… |
… | …111101100000111001 |
3 | 11001201220112120011112 |
4 | 213212003331200321 |
5 | 1144032203104422 |
6 | 31310401210105 |
7 | 3033356214326 |
oct | 474603754071 |
9 | 131656476145 |
10 | 42514503737 |
11 | 17037368a02 |
12 | 82a6030935 |
13 | 4016cbc4b4 |
14 | 20b4515b4d |
15 | 118c629ee2 |
hex | 9e60fd839 |
42514503737 has 8 divisors (see below), whose sum is σ = 45017159400. Its totient is φ = 40012048384.
The previous prime is 42514503719. The next prime is 42514503739. The reversal of 42514503737 is 73730541524.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2570084416 + 39944419321 = 50696^2 + 199861^2 .
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 42514503737 - 28 = 42514503481 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42514503694 and 42514503703.
It is not an unprimeable number, because it can be changed into a prime (42514503739) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 783089 + ... + 835617.
It is an arithmetic number, because the mean of its divisors is an integer number (5627144925).
Almost surely, 242514503737 is an apocalyptic number.
It is an amenable number.
42514503737 is a deficient number, since it is larger than the sum of its proper divisors (2502655663).
42514503737 is a wasteful number, since it uses less digits than its factorization.
42514503737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100155.
The product of its (nonzero) digits is 352800, while the sum is 41.
The spelling of 42514503737 in words is "forty-two billion, five hundred fourteen million, five hundred three thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •