Base | Representation |
---|---|
bin | 1111110011001101… |
… | …0110100010111001 |
3 | 101221120210101102102 |
4 | 3330303112202321 |
5 | 32141234220441 |
6 | 1540510113145 |
7 | 210050424533 |
oct | 37463264271 |
9 | 11846711372 |
10 | 4241320121 |
11 | 1887129645 |
12 | 9a44ab7b5 |
13 | 52791539c |
14 | 2c3410853 |
15 | 19c54269b |
hex | fccd68b9 |
4241320121 has 2 divisors, whose sum is σ = 4241320122. Its totient is φ = 4241320120.
The previous prime is 4241320043. The next prime is 4241320133. The reversal of 4241320121 is 1210231424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3752910121 + 488410000 = 61261^2 + 22100^2 .
It is a cyclic number.
It is not a de Polignac number, because 4241320121 - 226 = 4174211257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4241320093 and 4241320102.
It is not a weakly prime, because it can be changed into another prime (4241220121) 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, 2120660060 + 2120660061.
It is an arithmetic number, because the mean of its divisors is an integer number (2120660061).
Almost surely, 24241320121 is an apocalyptic number.
It is an amenable number.
4241320121 is a deficient number, since it is larger than the sum of its proper divisors (1).
4241320121 is an equidigital number, since it uses as much as digits as its factorization.
4241320121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 4241320121 is about 65125.4183940495. The cubic root of 4241320121 is about 1618.7024260035.
Adding to 4241320121 its reverse (1210231424), we get a palindrome (5451551545).
The spelling of 4241320121 in words is "four billion, two hundred forty-one million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •