Base | Representation |
---|---|
bin | 11000011101000… |
… | …11111011000001 |
3 | 112022000101022111 |
4 | 30032203323001 |
5 | 410004044440 |
6 | 32204535321 |
7 | 5040456502 |
oct | 1416437301 |
9 | 468011274 |
10 | 205143745 |
11 | a5886594 |
12 | 58851541 |
13 | 33668641 |
14 | 1d360ba9 |
15 | 130234ea |
hex | c3a3ec1 |
205143745 has 8 divisors (see below), whose sum is σ = 246260520. Its totient is φ = 164056320.
The previous prime is 205143737. The next prime is 205143781. The reversal of 205143745 is 547341502.
205143745 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 4892944 + 200250801 = 2212^2 + 14151^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 205143745 - 23 = 205143737 is a prime.
It is a super-2 number, since 2×2051437452 = 84167912225250050, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13351 + ... + 24259.
It is an arithmetic number, because the mean of its divisors is an integer number (30782565).
Almost surely, 2205143745 is an apocalyptic number.
It is an amenable number.
205143745 is a deficient number, since it is larger than the sum of its proper divisors (41116775).
205143745 is a wasteful number, since it uses less digits than its factorization.
205143745 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14675.
The product of its (nonzero) digits is 16800, while the sum is 31.
The square root of 205143745 is about 14322.8399767644. The cubic root of 205143745 is about 589.7746386260.
It can be divided in two parts, 2051 and 43745, that added together give a square (45796 = 2142).
The spelling of 205143745 in words is "two hundred five million, one hundred forty-three thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •