Base | Representation |
---|---|
bin | 1011111000011100101… |
… | …0010111001001100010 |
3 | 201111220020200110220110 |
4 | 2332013022113021202 |
5 | 11321030030301310 |
6 | 233435421552150 |
7 | 20514362515020 |
oct | 2760712271142 |
9 | 644806613813 |
10 | 204131103330 |
11 | 79631760290 |
12 | 3368b115656 |
13 | 1633215460b |
14 | 9c46a01710 |
15 | 549ae94d20 |
hex | 2f87297262 |
204131103330 has 128 divisors (see below), whose sum is σ = 620816265216. Its totient is φ = 41721465600.
The previous prime is 204131103329. The next prime is 204131103383. The reversal of 204131103330 is 33301131402.
204131103330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 204131103297 and 204131103306.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 583422 + ... + 865241.
It is an arithmetic number, because the mean of its divisors is an integer number (4850127072).
Almost surely, 2204131103330 is an apocalyptic number.
204131103330 is an abundant number, since it is smaller than the sum of its proper divisors (416685161886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204131103330 is a wasteful number, since it uses less digits than its factorization.
204131103330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1448752.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 204131103330 its reverse (33301131402), we get a palindrome (237432234732).
The spelling of 204131103330 in words is "two hundred four billion, one hundred thirty-one million, one hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •