Base | Representation |
---|---|
bin | 1011110101110110000… |
… | …1100001001011101000 |
3 | 201110002120012022100202 |
4 | 2331131201201023220 |
5 | 11313112211440124 |
6 | 233242225051332 |
7 | 20461150660016 |
oct | 2753541411350 |
9 | 643076168322 |
10 | 203432530664 |
11 | 793033a6300 |
12 | 33515186b48 |
13 | 162504c4acc |
14 | 9bbbd198b6 |
15 | 54599a55ae |
hex | 2f5d8612e8 |
203432530664 has 24 divisors (see below), whose sum is σ = 419264360130. Its totient is φ = 92469331680.
The previous prime is 203432530663. The next prime is 203432530703. The reversal of 203432530664 is 466035234302.
203432530664 is digitally balanced in base 2, 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., 197198164900 + 6234365764 = 444070^2 + 78958^2 .
It is not an unprimeable number, because it can be changed into a prime (203432530663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 105077819 + ... + 105079754.
Almost surely, 2203432530664 is an apocalyptic number.
It is an amenable number.
203432530664 is an abundant number, since it is smaller than the sum of its proper divisors (215831829466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203432530664 is a wasteful number, since it uses less digits than its factorization.
203432530664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210157601 (or 210157586 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 38.
Adding to 203432530664 its reverse (466035234302), we get a palindrome (669467764966).
The spelling of 203432530664 in words is "two hundred three billion, four hundred thirty-two million, five hundred thirty thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •