Base | Representation |
---|---|
bin | 100110000011111… |
… | …101100101100100 |
3 | 1122111120212100011 |
4 | 212003331211210 |
5 | 2301433313100 |
6 | 143210500004 |
7 | 21552531400 |
oct | 4603754544 |
9 | 1574525304 |
10 | 638572900 |
11 | 2a85042a9 |
12 | 159a34604 |
13 | a23b29b4 |
14 | 60b48100 |
15 | 3b0dbbba |
hex | 260fd964 |
638572900 has 135 divisors (see below), whose sum is σ = 1701492009. Its totient is φ = 207416160.
The previous prime is 638572889. The next prime is 638572969. The reversal of 638572900 is 9275836.
The square root of 638572900 is 25270.
It is a perfect power (a square), and thus also a powerful number.
638572900 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 229886244 + 408686656 = 15162^2 + 20216^2 .
It is a super-2 number, since 2×6385729002 = 815550697228820000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 33609091 + ... + 33609109.
Almost surely, 2638572900 is an apocalyptic number.
638572900 is the 25270-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 638572900
638572900 is an abundant number, since it is smaller than the sum of its proper divisors (1062919109).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
638572900 is an equidigital number, since it uses as much as digits as its factorization.
638572900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104 (or 33 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 40.
The cubic root of 638572900 is about 861.1328589567.
The spelling of 638572900 in words is "six hundred thirty-eight million, five hundred seventy-two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •