Base | Representation |
---|---|
bin | 1000011100000100… |
… | …1010110011000011 |
3 | 12211212102122010002 |
4 | 2013001022303003 |
5 | 14114344334111 |
6 | 1012435430215 |
7 | 110064066434 |
oct | 20701126303 |
9 | 5755378102 |
10 | 2265230531 |
11 | a62733253 |
12 | 53275536b |
13 | 2a13c02c5 |
14 | 176bbb48b |
15 | d3d0463b |
hex | 8704acc3 |
2265230531 has 4 divisors (see below), whose sum is σ = 2267391000. Its totient is φ = 2263070064.
The previous prime is 2265230519. The next prime is 2265230533. The reversal of 2265230531 is 1350325622.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2265230531 - 210 = 2265229507 is a prime.
It is a super-2 number, since 2×22652305312 = 10262538717149083922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2265230494 and 2265230503.
It is not an unprimeable number, because it can be changed into a prime (2265230533) 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, 1078661 + ... + 1080758.
It is an arithmetic number, because the mean of its divisors is an integer number (566847750).
Almost surely, 22265230531 is an apocalyptic number.
2265230531 is a deficient number, since it is larger than the sum of its proper divisors (2160469).
2265230531 is a wasteful number, since it uses less digits than its factorization.
2265230531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2160468.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 2265230531 is about 47594.4380258870. The cubic root of 2265230531 is about 1313.3207383176.
The spelling of 2265230531 in words is "two billion, two hundred sixty-five million, two hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •