Base | Representation |
---|---|
bin | 11010110101010… |
… | …10010100000101 |
3 | 120200112220100221 |
4 | 31122222110011 |
5 | 430110432434 |
6 | 34200304341 |
7 | 5402154301 |
oct | 1532522405 |
9 | 520486327 |
10 | 225092869 |
11 | 106071671 |
12 | 634720b1 |
13 | 37831861 |
14 | 21c74d01 |
15 | 14b642b4 |
hex | d6aa505 |
225092869 has 4 divisors (see below), whose sum is σ = 238333644. Its totient is φ = 211852096.
The previous prime is 225092863. The next prime is 225092873. The reversal of 225092869 is 968290522.
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 114211969 + 110880900 = 10687^2 + 10530^2 .
It is not a de Polignac number, because 225092869 - 217 = 224961797 is a prime.
It is a super-2 number, since 2×2250928692 = 101333599349302322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225092863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6620362 + ... + 6620395.
It is an arithmetic number, because the mean of its divisors is an integer number (59583411).
Almost surely, 2225092869 is an apocalyptic number.
It is an amenable number.
225092869 is a deficient number, since it is larger than the sum of its proper divisors (13240775).
225092869 is a wasteful number, since it uses less digits than its factorization.
225092869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13240774.
The product of its (nonzero) digits is 155520, while the sum is 43.
The square root of 225092869 is about 15003.0953139677. The cubic root of 225092869 is about 608.3038692345.
The spelling of 225092869 in words is "two hundred twenty-five million, ninety-two thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •