Base | Representation |
---|---|
bin | 100000010000111010001… |
… | …1111000010100000000000 |
3 | 120200220212012200112002021 |
4 | 1000201310133002200000 |
5 | 1040123032244340412 |
6 | 13233041143531224 |
7 | 635241405465034 |
oct | 100416437024000 |
9 | 16626765615067 |
10 | 4434360543232 |
11 | 145a668a17734 |
12 | 5b74aa459b14 |
13 | 26220a028659 |
14 | 1148a4b141c4 |
15 | 7a534220607 |
hex | 408747c2800 |
4434360543232 has 48 divisors (see below), whose sum is σ = 8876953924020. Its totient is φ = 2214580125696.
The previous prime is 4434360543181. The next prime is 4434360543253. The reversal of 4434360543232 is 2323450634344.
It can be written as a sum of positive squares in 2 ways, for example, as 4171659191296 + 262701351936 = 2042464^2 + 512544^2 .
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 3 ways as a sum of consecutive naturals, for example, 477768 + ... + 3016120.
Almost surely, 24434360543232 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 4434360543232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4438476962010).
4434360543232 is an abundant number, since it is smaller than the sum of its proper divisors (4442593380788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4434360543232 is an equidigital number, since it uses as much as digits as its factorization.
4434360543232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2539228 (or 2539208 counting only the distinct ones).
The product of its (nonzero) digits is 2488320, while the sum is 43.
The spelling of 4434360543232 in words is "four trillion, four hundred thirty-four billion, three hundred sixty million, five hundred forty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •