Base | Representation |
---|---|
bin | 1110011100110… |
… | …01011010000000 |
3 | 22110002100011100 |
4 | 13032121122000 |
5 | 222012331332 |
6 | 20010014400 |
7 | 3001210212 |
oct | 716313200 |
9 | 273070140 |
10 | 121214592 |
11 | 62471354 |
12 | 34717400 |
13 | 1c160a15 |
14 | 121545b2 |
15 | a99567c |
hex | 7399680 |
121214592 has 96 divisors (see below), whose sum is σ = 357065280. Its totient is φ = 39449088.
The previous prime is 121214579. The next prime is 121214593. The reversal of 121214592 is 295412121.
It is a tau number, because it is divible by the number of its divisors (96).
It is not an unprimeable number, because it can be changed into a prime (121214593) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 48313 + ... + 50759.
It is an arithmetic number, because the mean of its divisors is an integer number (3719430).
Almost surely, 2121214592 is an apocalyptic number.
121214592 is a gapful number since it is divisible by the number (12) 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 121214592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178532640).
121214592 is an abundant number, since it is smaller than the sum of its proper divisors (235850688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121214592 is a wasteful number, since it uses less digits than its factorization.
121214592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2510 (or 2495 counting only the distinct ones).
The product of its digits is 1440, while the sum is 27.
The square root of 121214592 is about 11009.7498609187. The cubic root of 121214592 is about 494.9009658014.
The spelling of 121214592 in words is "one hundred twenty-one million, two hundred fourteen thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •