Base | Representation |
---|---|
bin | 1111101111001011… |
… | …1101100101000001 |
3 | 101220102000211010111 |
4 | 3323302331211001 |
5 | 32122424100031 |
6 | 1535104231321 |
7 | 206454103321 |
oct | 37362754501 |
9 | 11812024114 |
10 | 4224440641 |
11 | 187864a863 |
12 | 99a90b541 |
13 | 524285425 |
14 | 2c1099281 |
15 | 19ad0b1b1 |
hex | fbcbd941 |
4224440641 has 4 divisors (see below), whose sum is σ = 4230316800. Its totient is φ = 4218564484.
The previous prime is 4224440609. The next prime is 4224440657. The reversal of 4224440641 is 1460444224.
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 4224440641 - 25 = 4224440609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4224444641) 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, 2937001 + ... + 2938438.
It is an arithmetic number, because the mean of its divisors is an integer number (1057579200).
Almost surely, 24224440641 is an apocalyptic number.
It is an amenable number.
4224440641 is a deficient number, since it is larger than the sum of its proper divisors (5876159).
4224440641 is an equidigital number, since it uses as much as digits as its factorization.
4224440641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5876158.
The product of its (nonzero) digits is 24576, while the sum is 31.
The square root of 4224440641 is about 64995.6970960386. The cubic root of 4224440641 is about 1616.5522163968.
Adding to 4224440641 its reverse (1460444224), we get a palindrome (5684884865).
The spelling of 4224440641 in words is "four billion, two hundred twenty-four million, four hundred forty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •