Base | Representation |
---|---|
bin | 100100000101001010111… |
… | …0110110111000000010000 |
3 | 122120001210201100021121210 |
4 | 1020022111312313000100 |
5 | 1122221320022231330 |
6 | 14314031251020120 |
7 | 1021161216212604 |
oct | 110122566670020 |
9 | 18501721307553 |
10 | 4958906445840 |
11 | 1642073457056 |
12 | 68109b89a640 |
13 | 29c8135a9c49 |
14 | 132025c77504 |
15 | 88ed4c288b0 |
hex | 48295db7010 |
4958906445840 has 160 divisors (see below), whose sum is σ = 16066993718016. Its totient is φ = 1262829568000.
The previous prime is 4958906445821. The next prime is 4958906445877. The reversal of 4958906445840 is 485446098594.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2677840 + ... + 4133840.
Almost surely, 24958906445840 is an apocalyptic number.
4958906445840 is a gapful number since it is divisible by the number (40) 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 4958906445840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8033496859008).
4958906445840 is an abundant number, since it is smaller than the sum of its proper divisors (11108087272176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4958906445840 is a wasteful number, since it uses less digits than its factorization.
4958906445840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1456657 (or 1456651 counting only the distinct ones).
The product of its (nonzero) digits is 199065600, while the sum is 66.
The spelling of 4958906445840 in words is "four trillion, nine hundred fifty-eight billion, nine hundred six million, four hundred forty-five thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •