Base | Representation |
---|---|
bin | 1000111100110011… |
… | …10110111100101001 |
3 | 110101212120110111121 |
4 | 10132121312330221 |
5 | 34320043444231 |
6 | 2112445055241 |
7 | 230034233254 |
oct | 43631667451 |
9 | 13355513447 |
10 | 4805062441 |
11 | 2046372593 |
12 | b21257521 |
13 | 5b765791a |
14 | 33823a09b |
15 | 1d1c9c311 |
hex | 11e676f29 |
4805062441 has 4 divisors (see below), whose sum is σ = 4810011984. Its totient is φ = 4800112900.
The previous prime is 4805062433. The next prime is 4805062453. The reversal of 4805062441 is 1442605084.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4805062441 - 23 = 4805062433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4805062397 and 4805062406.
It is not an unprimeable number, because it can be changed into a prime (4805062541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2473315 + ... + 2475256.
It is an arithmetic number, because the mean of its divisors is an integer number (1202502996).
Almost surely, 24805062441 is an apocalyptic number.
It is an amenable number.
4805062441 is a deficient number, since it is larger than the sum of its proper divisors (4949543).
4805062441 is an equidigital number, since it uses as much as digits as its factorization.
4805062441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4949542.
The product of its (nonzero) digits is 30720, while the sum is 34.
The square root of 4805062441 is about 69318.5576956128. The cubic root of 4805062441 is about 1687.4581539216.
The spelling of 4805062441 in words is "four billion, eight hundred five million, sixty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •