Base | Representation |
---|---|
bin | 1011101001100000010… |
… | …1100110010011000000 |
3 | 201010112201021101202202 |
4 | 2322120011212103000 |
5 | 11234321221200112 |
6 | 231533420132332 |
7 | 20313106532606 |
oct | 2723005462300 |
9 | 633481241682 |
10 | 200120100032 |
11 | 77963641126 |
12 | 3294b9970a8 |
13 | 15b4317c798 |
14 | 9986025876 |
15 | 5313c996c2 |
hex | 2e981664c0 |
200120100032 has 56 divisors (see below), whose sum is σ = 406945984176. Its totient is φ = 97604369408.
The previous prime is 200120100001. The next prime is 200120100053. The reversal of 200120100032 is 230001021002.
It is a happy number.
200120100032 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200120099986 and 200120100022.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 416303 + ... + 757329.
Almost surely, 2200120100032 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 200120100032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203472992088).
200120100032 is an abundant number, since it is smaller than the sum of its proper divisors (206825884144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200120100032 is a wasteful number, since it uses less digits than its factorization.
200120100032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341265 (or 341255 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 200120100032 its reverse (230001021002), we get a palindrome (430121121034).
The spelling of 200120100032 in words is "two hundred billion, one hundred twenty million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •