Base | Representation |
---|---|
bin | 1110011100001… |
… | …01010000010010 |
3 | 22102221010221020 |
4 | 13032011100102 |
5 | 222002211200 |
6 | 20004140310 |
7 | 3000414444 |
oct | 716052022 |
9 | 272833836 |
10 | 121132050 |
11 | 62415336 |
12 | 34697696 |
13 | 1c132290 |
14 | 12132494 |
15 | a97aea0 |
hex | 7385412 |
121132050 has 48 divisors (see below), whose sum is σ = 323520960. Its totient is φ = 29816640.
The previous prime is 121132003. The next prime is 121132051. The reversal of 121132050 is 50231121.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (121132051) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 29110 + ... + 33009.
It is an arithmetic number, because the mean of its divisors is an integer number (6740020).
Almost surely, 2121132050 is an apocalyptic number.
121132050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121132050 is an abundant number, since it is smaller than the sum of its proper divisors (202388910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121132050 is a wasteful number, since it uses less digits than its factorization.
121132050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62147 (or 62142 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 121132050 is about 11006.0006360167. Note that the first 3 decimals coincide. The cubic root of 121132050 is about 494.7886047653.
Adding to 121132050 its reverse (50231121), we get a palindrome (171363171).
The spelling of 121132050 in words is "one hundred twenty-one million, one hundred thirty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •