Base | Representation |
---|---|
bin | 11000011101001… |
… | …00000000111101 |
3 | 112022000101211120 |
4 | 30032210000331 |
5 | 410004103000 |
6 | 32204541153 |
7 | 5040460554 |
oct | 1416440075 |
9 | 468011746 |
10 | 205144125 |
11 | a58868aa |
12 | 588517b9 |
13 | 33668874 |
14 | 1d360d9b |
15 | 130236a0 |
hex | c3a403d |
205144125 has 32 divisors (see below), whose sum is σ = 343200000. Its totient is φ = 108820800.
The previous prime is 205144109. The next prime is 205144129. The reversal of 205144125 is 521441502.
It is not a de Polignac number, because 205144125 - 24 = 205144109 is a prime.
It is a super-2 number, since 2×2051441252 = 84168224044031250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 205144095 and 205144104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (205144129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73251 + ... + 75999.
It is an arithmetic number, because the mean of its divisors is an integer number (10725000).
Almost surely, 2205144125 is an apocalyptic number.
205144125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
205144125 is a deficient number, since it is larger than the sum of its proper divisors (138055875).
205144125 is a wasteful number, since it uses less digits than its factorization.
205144125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2966 (or 2956 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 24.
The square root of 205144125 is about 14322.8532422838. The cubic root of 205144125 is about 589.7750027840.
Adding to 205144125 its reverse (521441502), we get a palindrome (726585627).
The spelling of 205144125 in words is "two hundred five million, one hundred forty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •