Base | Representation |
---|---|
bin | 1111101110100010… |
… | …0110100111101001 |
3 | 101220012220212012011 |
4 | 3323220212213221 |
5 | 32121230201121 |
6 | 1534530115521 |
7 | 206422033423 |
oct | 37350464751 |
9 | 11805825164 |
10 | 4221725161 |
11 | 1877065665 |
12 | 999a1bba1 |
13 | 523844434 |
14 | 2c098d813 |
15 | 19a9717e1 |
hex | fba269e9 |
4221725161 has 4 divisors (see below), whose sum is σ = 4275164800. Its totient is φ = 4168285524.
The previous prime is 4221725153. The next prime is 4221725177. The reversal of 4221725161 is 1615271224.
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 4221725161 - 23 = 4221725153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4221725191) 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, 26719701 + ... + 26719858.
It is an arithmetic number, because the mean of its divisors is an integer number (1068791200).
Almost surely, 24221725161 is an apocalyptic number.
It is an amenable number.
4221725161 is a deficient number, since it is larger than the sum of its proper divisors (53439639).
4221725161 is an equidigital number, since it uses as much as digits as its factorization.
4221725161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53439638.
The product of its digits is 6720, while the sum is 31.
The square root of 4221725161 is about 64974.8040474152. The cubic root of 4221725161 is about 1616.2057676797.
Adding to 4221725161 its reverse (1615271224), we get a palindrome (5836996385).
The spelling of 4221725161 in words is "four billion, two hundred twenty-one million, seven hundred twenty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •