Base | Representation |
---|---|
bin | 1111010010000011… |
… | …0100100011100101 |
3 | 101120220002121122111 |
4 | 3310200310203211 |
5 | 31400133311311 |
6 | 1515021201021 |
7 | 203441334511 |
oct | 36440644345 |
9 | 11526077574 |
10 | 4102244581 |
11 | 1815679086 |
12 | 965a00171 |
13 | 504b6ca76 |
14 | 2acb6b141 |
15 | 19021ed21 |
hex | f48348e5 |
4102244581 has 2 divisors, whose sum is σ = 4102244582. Its totient is φ = 4102244580.
The previous prime is 4102244579. The next prime is 4102244617. The reversal of 4102244581 is 1854422014.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3774996481 + 327248100 = 61441^2 + 18090^2 .
It is a cyclic number.
It is not a de Polignac number, because 4102244581 - 21 = 4102244579 is a prime.
It is a super-2 number, since 2×41022445812 = 33656821204687731122, which contains 22 as substring.
Together with 4102244579, 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 (4102244521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051122290 + 2051122291.
It is an arithmetic number, because the mean of its divisors is an integer number (2051122291).
Almost surely, 24102244581 is an apocalyptic number.
It is an amenable number.
4102244581 is a deficient number, since it is larger than the sum of its proper divisors (1).
4102244581 is an equidigital number, since it uses as much as digits as its factorization.
4102244581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10240, while the sum is 31.
The square root of 4102244581 is about 64048.7672090572. The cubic root of 4102244581 is about 1600.8126836303.
Adding to 4102244581 its reverse (1854422014), we get a palindrome (5956666595).
The spelling of 4102244581 in words is "four billion, one hundred two million, two hundred forty-four thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •