Base | Representation |
---|---|
bin | 1111110101111110… |
… | …1110010111000000 |
3 | 101222101200100100202 |
4 | 3331133232113000 |
5 | 32202223431000 |
6 | 1542003304332 |
7 | 210251331653 |
oct | 37537562700 |
9 | 11871610322 |
10 | 4252952000 |
11 | 1892753870 |
12 | 9a837b0a8 |
13 | 52a15895b |
14 | 2c4b9b89a |
15 | 19d58ddd5 |
hex | fd7ee5c0 |
4252952000 has 224 divisors, whose sum is σ = 11868180480. Its totient is φ = 1495680000.
The previous prime is 4252951991. The next prime is 4252952009. The reversal of 4252952000 is 2592524.
It is an interprime number because it is at equal distance from previous prime (4252951991) and next prime (4252952009).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4252952009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2727221 + ... + 2728779.
Almost surely, 24252952000 is an apocalyptic number.
4252952000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4252952000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5934090240).
4252952000 is an abundant number, since it is smaller than the sum of its proper divisors (7615228480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4252952000 is a wasteful number, since it uses less digits than its factorization.
4252952000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1628 (or 1608 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 4252952000 is about 65214.6609283526. The cubic root of 4252952000 is about 1620.1808465485.
The spelling of 4252952000 in words is "four billion, two hundred fifty-two million, nine hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •