Base | Representation |
---|---|
bin | 100111100111110101… |
… | …000100000111010011 |
3 | 11001210222022220100222 |
4 | 213213311010013103 |
5 | 1144112300344133 |
6 | 31313340503255 |
7 | 3034166222420 |
oct | 474765040723 |
9 | 131728286328 |
10 | 42544153043 |
11 | 17052079967 |
12 | 82b3b4ab2b |
13 | 40201a0972 |
14 | 20b8432d47 |
15 | 1190034e98 |
hex | 9e7d441d3 |
42544153043 has 8 divisors (see below), whose sum is σ = 48625795680. Its totient is φ = 36463487040.
The previous prime is 42544153019. The next prime is 42544153051. The reversal of 42544153043 is 34035144524.
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 42544153043 - 212 = 42544148947 is a prime.
It is a super-3 number, since 3×425441530433 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42544152994 and 42544153012.
It is not an unprimeable number, because it can be changed into a prime (42544153073) 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, 148298 + ... + 327231.
It is an arithmetic number, because the mean of its divisors is an integer number (6078224460).
Almost surely, 242544153043 is an apocalyptic number.
42544153043 is a deficient number, since it is larger than the sum of its proper divisors (6081642637).
42544153043 is a wasteful number, since it uses less digits than its factorization.
42544153043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488317.
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 42544153043 its reverse (34035144524), we get a palindrome (76579297567).
The spelling of 42544153043 in words is "forty-two billion, five hundred forty-four million, one hundred fifty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •