Base | Representation |
---|---|
bin | 1011111010010111011… |
… | …0100111001111010100 |
3 | 201120020010120221212011 |
4 | 2332211312213033110 |
5 | 11323103340120202 |
6 | 234002454234004 |
7 | 20533214316655 |
oct | 2764566471724 |
9 | 646203527764 |
10 | 204646020052 |
11 | 798763858a1 |
12 | 337b3655904 |
13 | 163b4a30176 |
14 | 9c9515b52c |
15 | 54cb2a7bd7 |
hex | 2fa5da73d4 |
204646020052 has 6 divisors (see below), whose sum is σ = 358130535098. Its totient is φ = 102323010024.
The previous prime is 204646020031. The next prime is 204646020053. The reversal of 204646020052 is 250020646402.
204646020052 is digitally balanced in base 3, 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 only one way, i.e., 145287519556 + 59358500496 = 381166^2 + 243636^2 .
It is a junction number, because it is equal to n+sod(n) for n = 204646019996 and 204646020023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204646020053) 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 as a sum of consecutive naturals, namely, 25580752503 + ... + 25580752510.
Almost surely, 2204646020052 is an apocalyptic number.
It is an amenable number.
204646020052 is a deficient number, since it is larger than the sum of its proper divisors (153484515046).
204646020052 is a wasteful number, since it uses less digits than its factorization.
204646020052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51161505017 (or 51161505015 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 204646020052 its reverse (250020646402), we get a palindrome (454666666454).
The spelling of 204646020052 in words is "two hundred four billion, six hundred forty-six million, twenty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •