Base | Representation |
---|---|
bin | 1000010010100001… |
… | …0100011000100101 |
3 | 12202002000221002201 |
4 | 2010220110120211 |
5 | 14024120134030 |
6 | 1004444534501 |
7 | 106066364041 |
oct | 20450243045 |
9 | 5662027081 |
10 | 2225161765 |
11 | a42055a72 |
12 | 521251431 |
13 | 296001388 |
14 | 17174b021 |
15 | d053c2ca |
hex | 84a14625 |
2225161765 has 4 divisors (see below), whose sum is σ = 2670194124. Its totient is φ = 1780129408.
The previous prime is 2225161751. The next prime is 2225161817. The reversal of 2225161765 is 5671615222.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1422119521 + 803042244 = 37711^2 + 28338^2 .
It is a cyclic number.
It is not a de Polignac number, because 2225161765 - 213 = 2225153573 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 222516172 + ... + 222516181.
It is an arithmetic number, because the mean of its divisors is an integer number (667548531).
Almost surely, 22225161765 is an apocalyptic number.
It is an amenable number.
2225161765 is a deficient number, since it is larger than the sum of its proper divisors (445032359).
2225161765 is an equidigital number, since it uses as much as digits as its factorization.
2225161765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445032358.
The product of its digits is 50400, while the sum is 37.
The square root of 2225161765 is about 47171.6203346885. The cubic root of 2225161765 is about 1305.5310229107.
Adding to 2225161765 its reverse (5671615222), we get a palindrome (7896776987).
The spelling of 2225161765 in words is "two billion, two hundred twenty-five million, one hundred sixty-one thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •