Base | Representation |
---|---|
bin | 1110011100101… |
… | …10001011000110 |
3 | 22110001122222220 |
4 | 13032112023012 |
5 | 222011420400 |
6 | 20005433210 |
7 | 3001123464 |
oct | 716261306 |
9 | 273048886 |
10 | 121201350 |
11 | 62462406 |
12 | 3470b806 |
13 | 1c15799a |
14 | 1214d834 |
15 | a9917a0 |
hex | 73962c6 |
121201350 has 48 divisors (see below), whose sum is σ = 301767888. Its totient is φ = 32192640.
The previous prime is 121201343. The next prime is 121201363. The reversal of 121201350 is 53102121.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40092 + ... + 43008.
It is an arithmetic number, because the mean of its divisors is an integer number (6286831).
Almost surely, 2121201350 is an apocalyptic number.
121201350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 121201350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150883944).
121201350 is an abundant number, since it is smaller than the sum of its proper divisors (180566538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121201350 is a wasteful number, since it uses less digits than its factorization.
121201350 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3209 (or 3204 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 121201350 is about 11009.1484684330. The cubic root of 121201350 is about 494.8829434463.
Adding to 121201350 its reverse (53102121), we get a palindrome (174303471).
The spelling of 121201350 in words is "one hundred twenty-one million, two hundred one thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •