Base | Representation |
---|---|
bin | 100010011000011101001… |
… | …0110010001111010000000 |
3 | 121201202012020120121022001 |
4 | 1010300322112101322000 |
5 | 1104410201343212030 |
6 | 14014501041553344 |
7 | 665254611203605 |
oct | 104607226217200 |
9 | 17652166517261 |
10 | 4725442944640 |
11 | 156205a394140 |
12 | 6439a5345854 |
13 | 2837b84983b2 |
14 | 1249d97706ac |
15 | 82dbda7ccca |
hex | 44c3a591e80 |
4725442944640 has 128 divisors (see below), whose sum is σ = 12324715341120. Its totient is φ = 1718206955520.
The previous prime is 4725442944637. The next prime is 4725442944653. The reversal of 4725442944640 is 464492445274.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×47254429446402 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (55).
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 15 ways as a sum of consecutive naturals, for example, 146042704 + ... + 146075056.
Almost surely, 24725442944640 is an apocalyptic number.
4725442944640 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4725442944640 is an abundant number, since it is smaller than the sum of its proper divisors (7599272396480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4725442944640 is a wasteful number, since it uses less digits than its factorization.
4725442944640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53130 (or 53118 counting only the distinct ones).
The product of its (nonzero) digits is 30965760, while the sum is 55.
The spelling of 4725442944640 in words is "four trillion, seven hundred twenty-five billion, four hundred forty-two million, nine hundred forty-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •