Base | Representation |
---|---|
bin | 1110010101100… |
… | …00101001010000 |
3 | 22101021220100112 |
4 | 13022300221100 |
5 | 221241324300 |
6 | 15533340452 |
7 | 2660126513 |
oct | 712605120 |
9 | 271256315 |
10 | 120261200 |
11 | 61980024 |
12 | 34337728 |
13 | 1bbb8a97 |
14 | 11d86d7a |
15 | a857e35 |
hex | 72b0a50 |
120261200 has 60 divisors (see below), whose sum is σ = 296014908. Its totient is φ = 46924800.
The previous prime is 120261101. The next prime is 120261217. The reversal of 120261200 is 2162021.
It can be written as a sum of positive squares in 6 ways, for example, as 58920976 + 61340224 = 7676^2 + 7832^2 .
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 12734 + ... + 20066.
Almost surely, 2120261200 is an apocalyptic number.
120261200 is a gapful number since it is divisible by the number (10) 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 120261200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148007454).
120261200 is an abundant number, since it is smaller than the sum of its proper divisors (175753708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120261200 is a wasteful number, since it uses less digits than its factorization.
120261200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7392 (or 7381 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 120261200 is about 10966.3667638831. The cubic root of 120261200 is about 493.6000302959.
The spelling of 120261200 in words is "one hundred twenty million, two hundred sixty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •