Base | Representation |
---|---|
bin | 10000000101000001010… |
… | …10110110001100000100 |
3 | 1221210222021202221002201 |
4 | 20002200222312030010 |
5 | 33022410024303302 |
6 | 1101443114444244 |
7 | 54625155265240 |
oct | 10024052661404 |
9 | 1853867687081 |
10 | 552451400452 |
11 | 1a332545aa36 |
12 | 8b09aa33684 |
13 | 40132a320c3 |
14 | 1ca4b353420 |
15 | e585803c87 |
hex | 80a0ab6304 |
552451400452 has 48 divisors (see below), whose sum is σ = 1128861941760. Its totient is φ = 231634808352.
The previous prime is 552451400407. The next prime is 552451400471. The reversal of 552451400452 is 254004154255.
It is a super-2 number, since 2×5524514004522 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 3264049 + ... + 3429127.
It is an arithmetic number, because the mean of its divisors is an integer number (23517957120).
Almost surely, 2552451400452 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 552451400452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (564430970880).
552451400452 is an abundant number, since it is smaller than the sum of its proper divisors (576410541308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552451400452 is a wasteful number, since it uses less digits than its factorization.
552451400452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167680 (or 167678 counting only the distinct ones).
The product of its (nonzero) digits is 160000, while the sum is 37.
The spelling of 552451400452 in words is "five hundred fifty-two billion, four hundred fifty-one million, four hundred thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •