Base | Representation |
---|---|
bin | 111011000100001100… |
… | …000110100001111101 |
3 | 20001200220220002200011 |
4 | 323010030012201331 |
5 | 2014341242031312 |
6 | 45045113103221 |
7 | 4403430010240 |
oct | 730414064175 |
9 | 201626802604 |
10 | 63421048957 |
11 | 2499558a852 |
12 | 1035b6b7b11 |
13 | 5c99442a06 |
14 | 30d8d7d257 |
15 | 19b2c66da7 |
hex | ec430687d |
63421048957 has 8 divisors (see below), whose sum is σ = 72507760832. Its totient is φ = 54340977600.
The previous prime is 63421048939. The next prime is 63421049009. The reversal of 63421048957 is 75984012436.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 63421048957 - 215 = 63421016189 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 63421048957.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63421048927) 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, 1639644 + ... + 1677877.
It is an arithmetic number, because the mean of its divisors is an integer number (9063470104).
It is a 1-persistent number, because it is pandigital, but 2⋅63421048957 = 126842097914 is not.
Almost surely, 263421048957 is an apocalyptic number.
It is an amenable number.
63421048957 is a deficient number, since it is larger than the sum of its proper divisors (9086711875).
63421048957 is a wasteful number, since it uses less digits than its factorization.
63421048957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3320259.
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 63421048957 in words is "sixty-three billion, four hundred twenty-one million, forty-eight thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •