Base | Representation |
---|---|
bin | 1011101001001111011… |
… | …0101010011011110000 |
3 | 201010100202122000001021 |
4 | 2322103312222123300 |
5 | 11234200030412302 |
6 | 231522401545224 |
7 | 20311255042405 |
oct | 2722366523360 |
9 | 633322560037 |
10 | 200049075952 |
11 | 77927540740 |
12 | 32930045214 |
13 | 15b31542abb |
14 | 997a8182ac |
15 | 530c91a437 |
hex | 2e93daa6f0 |
200049075952 has 80 divisors (see below), whose sum is σ = 428388876000. Its totient is φ = 89743979520.
The previous prime is 200049075929. The next prime is 200049075983. The reversal of 200049075952 is 259570940002.
It is a junction number, because it is equal to n+sod(n) for n = 200049075899 and 200049075908.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4092874 + ... + 4141462.
It is an arithmetic number, because the mean of its divisors is an integer number (5354860950).
Almost surely, 2200049075952 is an apocalyptic number.
200049075952 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200049075952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214194438000).
200049075952 is an abundant number, since it is smaller than the sum of its proper divisors (228339800048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200049075952 is a wasteful number, since it uses less digits than its factorization.
200049075952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48914 (or 48908 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 43.
The spelling of 200049075952 in words is "two hundred billion, forty-nine million, seventy-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •