Base | Representation |
---|---|
bin | 100111100111000111… |
… | …101000110000100001 |
3 | 11001210010220212221022 |
4 | 213213013220300201 |
5 | 1144101223311023 |
6 | 31312233335225 |
7 | 3033663053603 |
oct | 474707506041 |
9 | 131703825838 |
10 | 42532244513 |
11 | 17046385900 |
12 | 82abb67515 |
13 | 401a8914b5 |
14 | 20b6a13173 |
15 | 118de817c8 |
hex | 9e71e8c21 |
42532244513 has 6 divisors (see below), whose sum is σ = 46750318482. Its totient is φ = 38665676720.
The previous prime is 42532244507. The next prime is 42532244519. The reversal of 42532244513 is 31544223524.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (42532244507) and next prime (42532244519).
It can be written as a sum of positive squares in only one way, i.e., 40132910224 + 2399334289 = 200332^2 + 48983^2 .
It is not a de Polignac number, because 42532244513 - 222 = 42528050209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42532244519) 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 5 ways as a sum of consecutive naturals, for example, 175752956 + ... + 175753197.
It is an arithmetic number, because the mean of its divisors is an integer number (7791719747).
Almost surely, 242532244513 is an apocalyptic number.
It is an amenable number.
42532244513 is a deficient number, since it is larger than the sum of its proper divisors (4218073969).
42532244513 is a wasteful number, since it uses less digits than its factorization.
42532244513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351506175 (or 351506164 counting only the distinct ones).
The product of its digits is 115200, while the sum is 35.
The spelling of 42532244513 in words is "forty-two billion, five hundred thirty-two million, two hundred forty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •