Base | Representation |
---|---|
bin | 100110010011101… |
… | …110110000010100 |
3 | 1122210100212111200 |
4 | 212103232300110 |
5 | 2304013101302 |
6 | 143435232500 |
7 | 21632625513 |
oct | 4623566024 |
9 | 1583325450 |
10 | 642706452 |
11 | 2aa877963 |
12 | 15b2a8730 |
13 | a31cc29b |
14 | 6150267a |
15 | 3b65681c |
hex | 264eec14 |
642706452 has 36 divisors (see below), whose sum is σ = 1627487316. Its totient is φ = 213857280.
The previous prime is 642706451. The next prime is 642706459. The reversal of 642706452 is 254607246.
642706452 is a `hidden beast` number, since 6 + 4 + 2 + 7 + 0 + 645 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 469415556 + 173290896 = 21666^2 + 13164^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (642706451) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5302 + ... + 36242.
It is an arithmetic number, because the mean of its divisors is an integer number (45207981).
Almost surely, 2642706452 is an apocalyptic number.
It is an amenable number.
642706452 is an abundant number, since it is smaller than the sum of its proper divisors (984780864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642706452 is a wasteful number, since it uses less digits than its factorization.
642706452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31528 (or 31523 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 36.
The square root of 642706452 is about 25351.6558039115. The cubic root of 642706452 is about 862.9869331108.
The spelling of 642706452 in words is "six hundred forty-two million, seven hundred six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •