Base | Representation |
---|---|
bin | 1000010001100010… |
… | …11101010101000101 |
3 | 102110120200121111222 |
4 | 10020301131111011 |
5 | 33044142301323 |
6 | 2012442410125 |
7 | 215036440154 |
oct | 41061352505 |
9 | 12416617458 |
10 | 4442150213 |
11 | 197a529226 |
12 | a3b800945 |
13 | 55a400467 |
14 | 301d6b59b |
15 | 1aeeb29c8 |
hex | 108c5d545 |
4442150213 has 2 divisors, whose sum is σ = 4442150214. Its totient is φ = 4442150212.
The previous prime is 4442150191. The next prime is 4442150231. The reversal of 4442150213 is 3120512444.
Together with next prime (4442150231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3306595009 + 1135555204 = 57503^2 + 33698^2 .
It is a cyclic number.
It is not a de Polignac number, because 4442150213 - 212 = 4442146117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4442150513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2221075106 + 2221075107.
It is an arithmetic number, because the mean of its divisors is an integer number (2221075107).
Almost surely, 24442150213 is an apocalyptic number.
It is an amenable number.
4442150213 is a deficient number, since it is larger than the sum of its proper divisors (1).
4442150213 is an equidigital number, since it uses as much as digits as its factorization.
4442150213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3840, while the sum is 26.
The square root of 4442150213 is about 66649.4577097218. The cubic root of 4442150213 is about 1643.8584311302.
Adding to 4442150213 its reverse (3120512444), we get a palindrome (7562662657).
The spelling of 4442150213 in words is "four billion, four hundred forty-two million, one hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •