Base | Representation |
---|---|
bin | 1001000101111111… |
… | …1010101101100000 |
3 | 20022010021212021112 |
4 | 2101133322231200 |
5 | 14444403011024 |
6 | 1042120242452 |
7 | 114330460343 |
oct | 22137725540 |
9 | 6263255245 |
10 | 2441063264 |
11 | 1042a09a62 |
12 | 581610428 |
13 | 2cb965443 |
14 | 1922ac45a |
15 | e448800e |
hex | 917fab60 |
2441063264 has 12 divisors (see below), whose sum is σ = 4805843364. Its totient is φ = 1220531616.
The previous prime is 2441063237. The next prime is 2441063267. The reversal of 2441063264 is 4623601442.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 76283227 = 2441063264 / (2 + 4 + 4 + 1 + 0 + 6 + 3 + 2 + 6 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 2441063264.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2441063267) 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 as a sum of consecutive naturals, namely, 38141582 + ... + 38141645.
It is an arithmetic number, because the mean of its divisors is an integer number (400486947).
Almost surely, 22441063264 is an apocalyptic number.
It is an amenable number.
2441063264 is a deficient number, since it is larger than the sum of its proper divisors (2364780100).
2441063264 is an equidigital number, since it uses as much as digits as its factorization.
2441063264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76283237 (or 76283229 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
The square root of 2441063264 is about 49407.1175439329. The cubic root of 2441063264 is about 1346.4586220236.
The spelling of 2441063264 in words is "two billion, four hundred forty-one million, sixty-three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •