Base | Representation |
---|---|
bin | 100111100111000100… |
… | …100100111011100101 |
3 | 11001210002102010122121 |
4 | 213213010210323211 |
5 | 1144101022124110 |
6 | 31312204225541 |
7 | 3033653203234 |
oct | 474704447345 |
9 | 131702363577 |
10 | 42531442405 |
11 | 17045988201 |
12 | 82ab83b2b1 |
13 | 401a67038a |
14 | 20b6884b1b |
15 | 118dd73cda |
hex | 9e7124ee5 |
42531442405 has 4 divisors (see below), whose sum is σ = 51037730892. Its totient is φ = 34025153920.
The previous prime is 42531442379. The next prime is 42531442409. The reversal of 42531442405 is 50424413524.
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 8323460289 + 34207982116 = 91233^2 + 184954^2 .
It is not a de Polignac number, because 42531442405 - 213 = 42531434213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42531442409) 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 3 ways as a sum of consecutive naturals, for example, 4253144236 + ... + 4253144245.
It is an arithmetic number, because the mean of its divisors is an integer number (12759432723).
Almost surely, 242531442405 is an apocalyptic number.
It is an amenable number.
42531442405 is a deficient number, since it is larger than the sum of its proper divisors (8506288487).
42531442405 is an equidigital number, since it uses as much as digits as its factorization.
42531442405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8506288486.
The product of its (nonzero) digits is 76800, while the sum is 34.
Adding to 42531442405 its reverse (50424413524), we get a palindrome (92955855929).
The spelling of 42531442405 in words is "forty-two billion, five hundred thirty-one million, four hundred forty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •