Base | Representation |
---|---|
bin | 1011111001001000000… |
… | …1001010111100101000 |
3 | 201112100221102011011011 |
4 | 2332102001022330220 |
5 | 11321413142242212 |
6 | 233505445513304 |
7 | 20522033625514 |
oct | 2762201127450 |
9 | 645327364134 |
10 | 204313243432 |
11 | 797155548a1 |
12 | 33720112834 |
13 | 16360ac761c |
14 | 9c62c95144 |
15 | 54abe724a7 |
hex | 2f9204af28 |
204313243432 has 16 divisors (see below), whose sum is σ = 384394801140. Its totient is φ = 101807963136.
The previous prime is 204313243427. The next prime is 204313243439. The reversal of 204313243432 is 234342313402.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 202440604356 + 1872639076 = 449934^2 + 43274^2 .
It is a super-2 number, since 2×2043132434322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 204313243394 and 204313243403.
It is not an unprimeable number, because it can be changed into a prime (204313243439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43579833 + ... + 43584520.
Almost surely, 2204313243432 is an apocalyptic number.
It is an amenable number.
204313243432 is a deficient number, since it is larger than the sum of its proper divisors (180081557708).
204313243432 is a wasteful number, since it uses less digits than its factorization.
204313243432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87164652 (or 87164648 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 204313243432 its reverse (234342313402), we get a palindrome (438655556834).
The spelling of 204313243432 in words is "two hundred four billion, three hundred thirteen million, two hundred forty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •