Base | Representation |
---|---|
bin | 1111010010000010… |
… | …1100111000000001 |
3 | 101120220001000111022 |
4 | 3310200230320001 |
5 | 31400131304441 |
6 | 1515020355225 |
7 | 203441144006 |
oct | 36440547001 |
9 | 11526030438 |
10 | 4102213121 |
11 | 1815657486 |
12 | 9659a5b15 |
13 | 504b5b656 |
14 | 2acb5d8ad |
15 | 19021584b |
hex | f482ce01 |
4102213121 has 2 divisors, whose sum is σ = 4102213122. Its totient is φ = 4102213120.
The previous prime is 4102213099. The next prime is 4102213133. The reversal of 4102213121 is 1213122014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2103139600 + 1999073521 = 45860^2 + 44711^2 .
It is a cyclic number.
It is not a de Polignac number, because 4102213121 - 210 = 4102212097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4102213121.
It is not a weakly prime, because it can be changed into another prime (4102213151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051106560 + 2051106561.
It is an arithmetic number, because the mean of its divisors is an integer number (2051106561).
Almost surely, 24102213121 is an apocalyptic number.
It is an amenable number.
4102213121 is a deficient number, since it is larger than the sum of its proper divisors (1).
4102213121 is an equidigital number, since it uses as much as digits as its factorization.
4102213121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 4102213121 is about 64048.5216144760. The cubic root of 4102213121 is about 1600.8085914238.
Adding to 4102213121 its reverse (1213122014), we get a palindrome (5315335135).
The spelling of 4102213121 in words is "four billion, one hundred two million, two hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •