Base | Representation |
---|---|
bin | 1000010010100000… |
… | …1100110100001001 |
3 | 12202001222100120102 |
4 | 2010220030310021 |
5 | 14024113141021 |
6 | 1004444135145 |
7 | 106066204460 |
oct | 20450146411 |
9 | 5661870512 |
10 | 2225130761 |
11 | a42034747 |
12 | 5212374b5 |
13 | 295cc0229 |
14 | 17173d9d7 |
15 | d053300b |
hex | 84a0cd09 |
2225130761 has 16 divisors (see below), whose sum is σ = 2622056448. Its totient is φ = 1848646800.
The previous prime is 2225130749. The next prime is 2225130773. The reversal of 2225130761 is 1670315222.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2225130749) and next prime (2225130773).
It is not a de Polignac number, because 2225130761 - 218 = 2224868617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2225130461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11216 + ... + 67646.
It is an arithmetic number, because the mean of its divisors is an integer number (163878528).
Almost surely, 22225130761 is an apocalyptic number.
It is an amenable number.
2225130761 is a deficient number, since it is larger than the sum of its proper divisors (396925687).
2225130761 is a wasteful number, since it uses less digits than its factorization.
2225130761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56612.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 2225130761 is about 47171.2917037471. The cubic root of 2225130761 is about 1305.5249594007.
Adding to 2225130761 its reverse (1670315222), we get a palindrome (3895445983).
The spelling of 2225130761 in words is "two billion, two hundred twenty-five million, one hundred thirty thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •