Base | Representation |
---|---|
bin | 1011101001011110011… |
… | …1111110001000010010 |
3 | 201010112011122210212010 |
4 | 2322113213332020102 |
5 | 11234312224131310 |
6 | 231532541443350 |
7 | 20312653524300 |
oct | 2722747761022 |
9 | 633464583763 |
10 | 200112333330 |
11 | 7795a216968 |
12 | 32949270556 |
13 | 15b416905c0 |
14 | 9984da3270 |
15 | 5313263320 |
hex | 2e979fe212 |
200112333330 has 384 divisors, whose sum is σ = 635417395200. Its totient is φ = 39867158016.
The previous prime is 200112333319. The next prime is 200112333347. The reversal of 200112333330 is 33333211002.
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 = 200112333297 and 200112333306.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 139062751 + ... + 139064189.
It is an arithmetic number, because the mean of its divisors is an integer number (1654732800).
Almost surely, 2200112333330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200112333330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (317708697600).
200112333330 is an abundant number, since it is smaller than the sum of its proper divisors (435305061870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200112333330 is a wasteful number, since it uses less digits than its factorization.
200112333330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1878 (or 1871 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 200112333330 its reverse (33333211002), we get a palindrome (233445544332).
The spelling of 200112333330 in words is "two hundred billion, one hundred twelve million, three hundred thirty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •