Base | Representation |
---|---|
bin | 10111110110101… |
… | …11000001001000 |
3 | 111221112122112010 |
4 | 23323113001020 |
5 | 402212011102 |
6 | 31505015520 |
7 | 4646623344 |
oct | 1373270110 |
9 | 457478463 |
10 | 200110152 |
11 | a2a587a0 |
12 | 570245a0 |
13 | 325c5498 |
14 | 1c810624 |
15 | 1287bd6c |
hex | bed7048 |
200110152 has 32 divisors (see below), whose sum is σ = 545755680. Its totient is φ = 60639360.
The previous prime is 200110133. The next prime is 200110153. The reversal of 200110152 is 251011002.
200110152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (200110153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 378733 + ... + 379260.
It is an arithmetic number, because the mean of its divisors is an integer number (17054865).
Almost surely, 2200110152 is an apocalyptic number.
200110152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200110152 is an abundant number, since it is smaller than the sum of its proper divisors (345645528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200110152 is a wasteful number, since it uses less digits than its factorization.
200110152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 758013 (or 758009 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 12.
The square root of 200110152 is about 14146.0295489583. The cubic root of 200110152 is about 584.9108900723.
Adding to 200110152 its reverse (251011002), we get a palindrome (451121154).
The spelling of 200110152 in words is "two hundred million, one hundred ten thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •