Base | Representation |
---|---|
bin | 11000011110010… |
… | …10101100000011 |
3 | 112022022110010110 |
4 | 30033022230003 |
5 | 410024140111 |
6 | 32212202403 |
7 | 5042020440 |
oct | 1417125403 |
9 | 468273113 |
10 | 205302531 |
11 | a5984915 |
12 | 58909403 |
13 | 336c29b5 |
14 | 1d3a29c7 |
15 | 130555a6 |
hex | c3cab03 |
205302531 has 16 divisors (see below), whose sum is σ = 326444544. Its totient is φ = 112214784.
The previous prime is 205302527. The next prime is 205302551. The reversal of 205302531 is 135203502.
It is not a de Polignac number, because 205302531 - 22 = 205302527 is a prime.
It is a super-2 number, since 2×2053025312 = 84298258470011922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 205302498 and 205302507.
It is not an unprimeable number, because it can be changed into a prime (205302521) 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 15 ways as a sum of consecutive naturals, for example, 212046 + ... + 213011.
It is an arithmetic number, because the mean of its divisors is an integer number (20402784).
Almost surely, 2205302531 is an apocalyptic number.
205302531 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
205302531 is a deficient number, since it is larger than the sum of its proper divisors (121142013).
205302531 is a wasteful number, since it uses less digits than its factorization.
205302531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425090.
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 205302531 is about 14328.3820091453. The cubic root of 205302531 is about 589.9267657832.
The spelling of 205302531 in words is "two hundred five million, three hundred two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •