Base | Representation |
---|---|
bin | 100011100001000101110… |
… | …0110111100010011011111 |
3 | 122021122210220111120112221 |
4 | 1013002023212330103133 |
5 | 1114434124310333014 |
6 | 14214255024410211 |
7 | 1012446156440311 |
oct | 107021346742337 |
9 | 18248726446487 |
10 | 4881425089759 |
11 | 1612223228479 |
12 | 66a077476967 |
13 | 29541620169a |
14 | 12c3958037b1 |
15 | 86e9c919b24 |
hex | 4708b9bc4df |
4881425089759 has 8 divisors (see below), whose sum is σ = 4885014420000. Its totient is φ = 4877836004832.
The previous prime is 4881425089733. The next prime is 4881425089777. The reversal of 4881425089759 is 9579805241884.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4881425089759 - 225 = 4881391535327 is a prime.
It is a super-2 number, since 2×48814250897592 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4881425089459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63622182 + ... + 63698860.
It is an arithmetic number, because the mean of its divisors is an integer number (610626802500).
Almost surely, 24881425089759 is an apocalyptic number.
4881425089759 is a deficient number, since it is larger than the sum of its proper divisors (3589330241).
4881425089759 is a wasteful number, since it uses less digits than its factorization.
4881425089759 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122657.
The product of its (nonzero) digits is 232243200, while the sum is 70.
The spelling of 4881425089759 in words is "four trillion, eight hundred eighty-one billion, four hundred twenty-five million, eighty-nine thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •