Base | Representation |
---|---|
bin | 1111101110011110… |
… | …0001010011100011 |
3 | 101220012101102201222 |
4 | 3323213201103203 |
5 | 32121142110001 |
6 | 1534520045255 |
7 | 206416441616 |
oct | 37347412343 |
9 | 11805342658 |
10 | 4221441251 |
11 | 1876991325 |
12 | 99990382b |
13 | 523775141 |
14 | 2c091817d |
15 | 19a91761b |
hex | fb9e14e3 |
4221441251 has 4 divisors (see below), whose sum is σ = 4221874512. Its totient is φ = 4221007992.
The previous prime is 4221441247. The next prime is 4221441293. The reversal of 4221441251 is 1521441224.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4221441251 - 22 = 4221441247 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 4221441251.
It is not an unprimeable number, because it can be changed into a prime (4221641251) 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, 201671 + ... + 221616.
It is an arithmetic number, because the mean of its divisors is an integer number (1055468628).
Almost surely, 24221441251 is an apocalyptic number.
4221441251 is a deficient number, since it is larger than the sum of its proper divisors (433261).
4221441251 is an equidigital number, since it uses as much as digits as its factorization.
4221441251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433260.
The product of its digits is 2560, while the sum is 26.
The square root of 4221441251 is about 64972.6192407232. The cubic root of 4221441251 is about 1616.1695370514.
Adding to 4221441251 its reverse (1521441224), we get a palindrome (5742882475).
The spelling of 4221441251 in words is "four billion, two hundred twenty-one million, four hundred forty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •