Base | Representation |
---|---|
bin | 1110011100011… |
… | …10000010000000 |
3 | 22102222222020201 |
4 | 13032032002000 |
5 | 222004334000 |
6 | 20005014544 |
7 | 3000624322 |
oct | 716160200 |
9 | 272888221 |
10 | 121168000 |
11 | 6243a348 |
12 | 346b4454 |
13 | 1c145755 |
14 | 12141612 |
15 | a98696a |
hex | 738e080 |
121168000 has 64 divisors (see below), whose sum is σ = 301293720. Its totient is φ = 48460800.
The previous prime is 121167967. The next prime is 121168009. The reversal of 121168000 is 861121.
It can be written as a sum of positive squares in 4 ways, for example, as 79281216 + 41886784 = 8904^2 + 6472^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (121168009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12214 + ... + 19786.
Almost surely, 2121168000 is an apocalyptic number.
121168000 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 121168000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150646860).
121168000 is an abundant number, since it is smaller than the sum of its proper divisors (180125720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121168000 is an frugal number, since it uses more digits than its factorization.
121168000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7602 (or 7580 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 19.
The square root of 121168000 is about 11007.6337148363. The cubic root of 121168000 is about 494.8375482969.
The spelling of 121168000 in words is "one hundred twenty-one million, one hundred sixty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •