Base | Representation |
---|---|
bin | 1111011000111101… |
… | …0111101000100101 |
3 | 101122220121221002001 |
4 | 3312033113220211 |
5 | 31430043132401 |
6 | 1521534245301 |
7 | 204242553064 |
oct | 36617275045 |
9 | 11586557061 |
10 | 4131224101 |
11 | 182aa718a4 |
12 | 973656831 |
13 | 50ab78404 |
14 | 2b29521db |
15 | 192a46601 |
hex | f63d7a25 |
4131224101 has 2 divisors, whose sum is σ = 4131224102. Its totient is φ = 4131224100.
The previous prime is 4131224099. The next prime is 4131224171. The reversal of 4131224101 is 1014221314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3773030625 + 358193476 = 61425^2 + 18926^2 .
It is a cyclic number.
It is not a de Polignac number, because 4131224101 - 21 = 4131224099 is a prime.
Together with 4131224099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4131224171) 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 as a sum of consecutive naturals, namely, 2065612050 + 2065612051.
It is an arithmetic number, because the mean of its divisors is an integer number (2065612051).
Almost surely, 24131224101 is an apocalyptic number.
It is an amenable number.
4131224101 is a deficient number, since it is larger than the sum of its proper divisors (1).
4131224101 is an equidigital number, since it uses as much as digits as its factorization.
4131224101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 4131224101 is about 64274.5991897266. The cubic root of 4131224101 is about 1604.5733866134.
Adding to 4131224101 its reverse (1014221314), we get a palindrome (5145445415).
The spelling of 4131224101 in words is "four billion, one hundred thirty-one million, two hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •