Base | Representation |
---|---|
bin | 1011111010010001110… |
… | …0101100111100010000 |
3 | 201120011111020111102212 |
4 | 2332210130230330100 |
5 | 11323031321403243 |
6 | 234000253131252 |
7 | 20532510062633 |
oct | 2764434547420 |
9 | 646144214385 |
10 | 204622450448 |
11 | 79864047689 |
12 | 337a7789b28 |
13 | 163acb9a060 |
14 | 9c91d83c1a |
15 | 54c919e318 |
hex | 2fa472cf10 |
204622450448 has 80 divisors (see below), whose sum is σ = 441174429696. Its totient is φ = 91301506560.
The previous prime is 204622450447. The next prime is 204622450457. The reversal of 204622450448 is 844054226402.
204622450448 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (204622450441) 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 15 ways as a sum of consecutive naturals, for example, 6516161 + ... + 6547487.
Almost surely, 2204622450448 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 204622450448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (220587214848).
204622450448 is an abundant number, since it is smaller than the sum of its proper divisors (236551979248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204622450448 is a wasteful number, since it uses less digits than its factorization.
204622450448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32392 (or 32386 counting only the distinct ones).
The product of its (nonzero) digits is 491520, while the sum is 41.
The spelling of 204622450448 in words is "two hundred four billion, six hundred twenty-two million, four hundred fifty thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •