Base | Representation |
---|---|
bin | 100100001001101010011… |
… | …1011101000100000100001 |
3 | 122120222201010001010000212 |
4 | 1020103110323220200201 |
5 | 1122401044434041020 |
6 | 14322304504223505 |
7 | 1021652262145442 |
oct | 110232473504041 |
9 | 18528633033025 |
10 | 4968554596385 |
11 | 16461745a3396 |
12 | 682b32a6ab95 |
13 | 2a06c0414473 |
14 | 13269d3ab2c9 |
15 | 8939bc84cc5 |
hex | 484d4ee8821 |
4968554596385 has 8 divisors (see below), whose sum is σ = 5962277512296. Its totient is φ = 3974835679360.
The previous prime is 4968554596349. The next prime is 4968554596387. The reversal of 4968554596385 is 5836954558694.
It can be written as a sum of positive squares in 4 ways, for example, as 1075304706961 + 3893249889424 = 1036969^2 + 1973132^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4968554596385 - 26 = 4968554596321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4968554596387) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 4082507 + ... + 5157903.
It is an arithmetic number, because the mean of its divisors is an integer number (745284689037).
Almost surely, 24968554596385 is an apocalyptic number.
It is an amenable number.
4968554596385 is a deficient number, since it is larger than the sum of its proper divisors (993722915911).
4968554596385 is a wasteful number, since it uses less digits than its factorization.
4968554596385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1999443.
The product of its digits is 5598720000, while the sum is 77.
The spelling of 4968554596385 in words is "four trillion, nine hundred sixty-eight billion, five hundred fifty-four million, five hundred ninety-six thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •