Base | Representation |
---|---|
bin | 11010111100110… |
… | …011011001000000 |
3 | 1011111210102202000 |
4 | 122330303121000 |
5 | 1411222144002 |
6 | 112511024000 |
7 | 14130120051 |
oct | 3274633100 |
9 | 1144712660 |
10 | 452146752 |
11 | 212252602 |
12 | 10750b000 |
13 | 7289bb75 |
14 | 4409a728 |
15 | 29a6461c |
hex | 1af33640 |
452146752 has 112 divisors (see below), whose sum is σ = 1336121280. Its totient is φ = 149935104.
The previous prime is 452146741. The next prime is 452146813. The reversal of 452146752 is 257641254.
It is a happy number.
It is a super-4 number, since 4×4521467524 (a number of 36 digits) contains 4444 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 402063 + ... + 403185.
Almost surely, 2452146752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 452146752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (668060640).
452146752 is an abundant number, since it is smaller than the sum of its proper divisors (883974528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
452146752 is a wasteful number, since it uses less digits than its factorization.
452146752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1377 (or 1361 counting only the distinct ones).
The product of its digits is 67200, while the sum is 36.
The square root of 452146752 is about 21263.7426620997. The cubic root of 452146752 is about 767.5260747931.
The spelling of 452146752 in words is "four hundred fifty-two million, one hundred forty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •