Base | Representation |
---|---|
bin | 1011111001101001011… |
… | …0101111010101101001 |
3 | 201112201200121101012112 |
4 | 2332122112233111221 |
5 | 11322204444141431 |
6 | 233531403452105 |
7 | 20525352543164 |
oct | 2763226572551 |
9 | 645650541175 |
10 | 204453115241 |
11 | 797874a9631 |
12 | 3375ab27035 |
13 | 16383a8b4cb |
14 | 9c776a4adb |
15 | 54b93a0c2b |
hex | 2f9a5af569 |
204453115241 has 8 divisors (see below), whose sum is σ = 204957966144. Its totient is φ = 203948869680.
The previous prime is 204453115213. The next prime is 204453115261. The reversal of 204453115241 is 142511354402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 204453115241 - 234 = 187273246057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 204453115198 and 204453115207.
It is not an unprimeable number, because it can be changed into a prime (204453115261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 528755 + ... + 829751.
It is an arithmetic number, because the mean of its divisors is an integer number (25619745768).
Almost surely, 2204453115241 is an apocalyptic number.
It is an amenable number.
204453115241 is a deficient number, since it is larger than the sum of its proper divisors (504850903).
204453115241 is an equidigital number, since it uses as much as digits as its factorization.
204453115241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302671.
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 204453115241 its reverse (142511354402), we get a palindrome (346964469643).
The spelling of 204453115241 in words is "two hundred four billion, four hundred fifty-three million, one hundred fifteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •