Base | Representation |
---|---|
bin | 1110010110100… |
… | …1010100001000 |
3 | 11012021111011001 |
4 | 3211221110020 |
5 | 110402401300 |
6 | 5550144344 |
7 | 1330456534 |
oct | 345512410 |
9 | 135244131 |
10 | 60200200 |
11 | 30a88335 |
12 | 181b20b4 |
13 | c61a128 |
14 | 7dd0bc4 |
15 | 544216a |
hex | 3969508 |
60200200 has 72 divisors (see below), whose sum is σ = 146572650. Its totient is φ = 22992640.
The previous prime is 60200183. The next prime is 60200243. The reversal of 60200200 is 200206.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 34128964 + 26071236 = 5842^2 + 5106^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 105516 + ... + 106084.
Almost surely, 260200200 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 60200200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73286325).
60200200 is an abundant number, since it is smaller than the sum of its proper divisors (86372450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60200200 is a wasteful number, since it uses less digits than its factorization.
60200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631 (or 599 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 10.
The square root of 60200200 is about 7758.8787849792. The cubic root of 60200200 is about 391.9217010073.
Adding to 60200200 its reverse (200206), we get a palindrome (60400406).
The spelling of 60200200 in words is "sixty million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •