Base | Representation |
---|---|
bin | 101000111110100001… |
… | …101111100111010000 |
3 | 11012120100022212002110 |
4 | 220332201233213100 |
5 | 1210102132044003 |
6 | 32113540545320 |
7 | 3115220555106 |
oct | 507641574720 |
9 | 135510285073 |
10 | 43998706128 |
11 | 17729139153 |
12 | 863b0b2240 |
13 | 41c2640070 |
14 | 21b56a5c76 |
15 | 1227aa3a03 |
hex | a3e86f9d0 |
43998706128 has 160 divisors (see below), whose sum is σ = 129991430016. Its totient is φ = 12703924224.
The previous prime is 43998706117. The next prime is 43998706181. The reversal of 43998706128 is 82160789934.
It is a super-2 number, since 2×439987061282 (a number of 22 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 3675000 + ... + 3686952.
Almost surely, 243998706128 is an apocalyptic number.
43998706128 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 43998706128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64995715008).
43998706128 is an abundant number, since it is smaller than the sum of its proper divisors (85992723888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43998706128 is a wasteful number, since it uses less digits than its factorization.
43998706128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12341 (or 12335 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 57.
The spelling of 43998706128 in words is "forty-three billion, nine hundred ninety-eight million, seven hundred six thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •