Base | Representation |
---|---|
bin | 100110010001001… |
… | …010000110110101 |
3 | 1122202002121101221 |
4 | 212101022012311 |
5 | 2303330011203 |
6 | 143412550341 |
7 | 21624116365 |
oct | 4621120665 |
9 | 1582077357 |
10 | 642032053 |
11 | 2aa457203 |
12 | 15b0223b1 |
13 | a3024330 |
14 | 613a89a5 |
15 | 3b571abd |
hex | 2644a1b5 |
642032053 has 8 divisors (see below), whose sum is σ = 698266296. Its totient is φ = 586776000.
The previous prime is 642032033. The next prime is 642032087. The reversal of 642032053 is 350230246.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 120275089 + 521756964 = 10967^2 + 22842^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 642032053 - 29 = 642031541 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (642032023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 243178 + ... + 245803.
It is an arithmetic number, because the mean of its divisors is an integer number (87283287).
Almost surely, 2642032053 is an apocalyptic number.
It is an amenable number.
642032053 is a deficient number, since it is larger than the sum of its proper divisors (56234243).
642032053 is a wasteful number, since it uses less digits than its factorization.
642032053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489095.
The product of its (nonzero) digits is 4320, while the sum is 25.
The square root of 642032053 is about 25338.3514262471. The cubic root of 642032053 is about 862.6849802223.
Adding to 642032053 its reverse (350230246), we get a palindrome (992262299).
The spelling of 642032053 in words is "six hundred forty-two million, thirty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •