Base | Representation |
---|---|
bin | 1011101001111101001… |
… | …1101010110111000000 |
3 | 201010212011012101211000 |
4 | 2322133103222313000 |
5 | 11240043223313443 |
6 | 231553424252000 |
7 | 20316110236164 |
oct | 2723723526700 |
9 | 633764171730 |
10 | 200241229248 |
11 | 77a15a54315 |
12 | 32984471000 |
13 | 15b622b0688 |
14 | 9998156ca4 |
15 | 531e7248d3 |
hex | 2e9f4eadc0 |
200241229248 has 112 divisors (see below), whose sum is σ = 589340309760. Its totient is φ = 66671315712.
The previous prime is 200241229241. The next prime is 200241229249. The reversal of 200241229248 is 842922142002.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200241229241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1467415 + ... + 1598057.
Almost surely, 2200241229248 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 200241229248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (294670154880).
200241229248 is an abundant number, since it is smaller than the sum of its proper divisors (389099080512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200241229248 is a wasteful number, since it uses less digits than its factorization.
200241229248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131551 (or 131535 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 36.
The spelling of 200241229248 in words is "two hundred billion, two hundred forty-one million, two hundred twenty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •