Base | Representation |
---|---|
bin | 1011111100000100010… |
… | …1111010010011010101 |
3 | 201121101222111201020121 |
4 | 2333001011322103111 |
5 | 11330022332441000 |
6 | 234120101231541 |
7 | 20550433602061 |
oct | 2770105722325 |
9 | 647358451217 |
10 | 205103015125 |
11 | 79a90339a78 |
12 | 339007025b1 |
13 | 16458608a58 |
14 | 9cd9b1aaa1 |
15 | 5506478b1a |
hex | 2fc117a4d5 |
205103015125 has 16 divisors (see below), whose sum is σ = 256284310464. Its totient is φ = 163880010000.
The previous prime is 205103015087. The next prime is 205103015137. The reversal of 205103015125 is 521510301502.
It is not a de Polignac number, because 205103015125 - 225 = 205069460693 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 205103015125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 910231 + ... + 1112980.
It is an arithmetic number, because the mean of its divisors is an integer number (16017769404).
Almost surely, 2205103015125 is an apocalyptic number.
205103015125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
205103015125 is a deficient number, since it is larger than the sum of its proper divisors (51181295339).
205103015125 is an equidigital number, since it uses as much as digits as its factorization.
205103015125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2024037 (or 2024027 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 205103015125 its reverse (521510301502), we get a palindrome (726613316627).
The spelling of 205103015125 in words is "two hundred five billion, one hundred three million, fifteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •