Base | Representation |
---|---|
bin | 1110011011101… |
… | …11001101111000 |
3 | 22102211020001200 |
4 | 13031313031320 |
5 | 221443341202 |
6 | 20003014200 |
7 | 3000055014 |
oct | 715671570 |
9 | 272736050 |
10 | 121074552 |
11 | 62386115 |
12 | 3466a360 |
13 | 1c112061 |
14 | 12119544 |
15 | a968e1c |
hex | 7377378 |
121074552 has 24 divisors (see below), whose sum is σ = 327910440. Its totient is φ = 40358160.
The previous prime is 121074539. The next prime is 121074557. The reversal of 121074552 is 255470121.
121074552 is a `hidden beast` number, since 1 + 2 + 107 + 4 + 552 = 666.
It is a tau number, because it is divible by the number of its divisors (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121074557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 840724 + ... + 840867.
It is an arithmetic number, because the mean of its divisors is an integer number (13662935).
Almost surely, 2121074552 is an apocalyptic number.
121074552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121074552 is an abundant number, since it is smaller than the sum of its proper divisors (206835888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121074552 is a wasteful number, since it uses less digits than its factorization.
121074552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1681603 (or 1681596 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 121074552 is about 11003.3882054574. The cubic root of 121074552 is about 494.7103049326.
The spelling of 121074552 in words is "one hundred twenty-one million, seventy-four thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •