Base | Representation |
---|---|
bin | 100001000011111100100… |
… | …1101001110011101000000 |
3 | 121002101202111002020011120 |
4 | 1002013321031032131000 |
5 | 1043422013111110403 |
6 | 13355244515112240 |
7 | 646201412560434 |
oct | 102077115163500 |
9 | 17071674066146 |
10 | 4543961425728 |
11 | 14a20a084496a |
12 | 6147975a2680 |
13 | 26c65593284a |
14 | 119d00cc29c4 |
15 | 7d2eb27ae53 |
hex | 421f934e740 |
4543961425728 has 112 divisors (see below), whose sum is σ = 12656981544000. Its totient is φ = 1434748059648.
The previous prime is 4543961425711. The next prime is 4543961425733. The reversal of 4543961425728 is 8275241693454.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29358528 + ... + 29512896.
Almost surely, 24543961425728 is an apocalyptic number.
4543961425728 is a gapful number since it is divisible by the number (48) 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 4543961425728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6328490772000).
4543961425728 is an abundant number, since it is smaller than the sum of its proper divisors (8113020118272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4543961425728 is a wasteful number, since it uses less digits than its factorization.
4543961425728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162472 (or 162462 counting only the distinct ones).
The product of its digits is 58060800, while the sum is 60.
The spelling of 4543961425728 in words is "four trillion, five hundred forty-three billion, nine hundred sixty-one million, four hundred twenty-five thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •