Base | Representation |
---|---|
bin | 1011111000011101011… |
… | …0010111100000100111 |
3 | 201111220110121101001121 |
4 | 2332013112113200213 |
5 | 11321031332004120 |
6 | 233440013234411 |
7 | 20514431333365 |
oct | 2760726274047 |
9 | 644813541047 |
10 | 204134250535 |
11 | 7963350a886 |
12 | 33690192a07 |
13 | 163329b6c77 |
14 | 9c471c0635 |
15 | 549b3b75aa |
hex | 2f87597827 |
204134250535 has 8 divisors (see below), whose sum is σ = 245413897056. Its totient is φ = 163005536160.
The previous prime is 204134250521. The next prime is 204134250539. The reversal of 204134250535 is 535052431402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 204134250535 - 215 = 204134217767 is a prime.
It is a super-2 number, since 2×2041342505352 (a number of 23 digits) contains 22 as substring.
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 204134250535.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204134250539) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37730059 + ... + 37735468.
It is an arithmetic number, because the mean of its divisors is an integer number (30676737132).
Almost surely, 2204134250535 is an apocalyptic number.
204134250535 is a deficient number, since it is larger than the sum of its proper divisors (41279646521).
204134250535 is an equidigital number, since it uses as much as digits as its factorization.
204134250535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75466073.
The product of its (nonzero) digits is 72000, while the sum is 34.
Adding to 204134250535 its reverse (535052431402), we get a palindrome (739186681937).
The spelling of 204134250535 in words is "two hundred four billion, one hundred thirty-four million, two hundred fifty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •