Base | Representation |
---|---|
bin | 1110111010001101… |
… | …0101101001100001 |
3 | 101022220220220200122 |
4 | 3232203111221201 |
5 | 31144033203441 |
6 | 1501045530025 |
7 | 201115326314 |
oct | 35643255141 |
9 | 11286826618 |
10 | 4002241121 |
11 | 1774184a9a |
12 | 938413915 |
13 | 4ba227818 |
14 | 29d77897b |
15 | 18656934b |
hex | ee8d5a61 |
4002241121 has 2 divisors, whose sum is σ = 4002241122. Its totient is φ = 4002241120.
The previous prime is 4002241097. The next prime is 4002241127. The reversal of 4002241121 is 1211422004.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3774382096 + 227859025 = 61436^2 + 15095^2 .
It is a cyclic number.
It is not a de Polignac number, because 4002241121 - 26 = 4002241057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4002241121.
It is not a weakly prime, because it can be changed into another prime (4002241127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2001120560 + 2001120561.
It is an arithmetic number, because the mean of its divisors is an integer number (2001120561).
Almost surely, 24002241121 is an apocalyptic number.
It is an amenable number.
4002241121 is a deficient number, since it is larger than the sum of its proper divisors (1).
4002241121 is an equidigital number, since it uses as much as digits as its factorization.
4002241121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 4002241121 is about 63263.2683395349. The cubic root of 4002241121 is about 1587.6974597707.
Adding to 4002241121 its reverse (1211422004), we get a palindrome (5213663125).
The spelling of 4002241121 in words is "four billion, two million, two hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •