Base | Representation |
---|---|
bin | 1110011100011… |
… | …00010010101000 |
3 | 22102222121110201 |
4 | 13032030102220 |
5 | 222004121442 |
6 | 20004521544 |
7 | 3000564460 |
oct | 716142250 |
9 | 272877421 |
10 | 121160872 |
11 | 62434a58 |
12 | 346b02b4 |
13 | 1c142431 |
14 | 1213cba0 |
15 | a9847b7 |
hex | 738c4a8 |
121160872 has 64 divisors (see below), whose sum is σ = 285235200. Its totient is φ = 47044800.
The previous prime is 121160843. The next prime is 121160873. The reversal of 121160872 is 278061121.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 121160872.
It is not an unprimeable number, because it can be changed into a prime (121160873) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21997 + ... + 26947.
It is an arithmetic number, because the mean of its divisors is an integer number (4456800).
Almost surely, 2121160872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121160872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142617600).
121160872 is an abundant number, since it is smaller than the sum of its proper divisors (164074328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121160872 is a wasteful number, since it uses less digits than its factorization.
121160872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5006 (or 5002 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 28.
The square root of 121160872 is about 11007.3099347661. The cubic root of 121160872 is about 494.8278447689.
The spelling of 121160872 in words is "one hundred twenty-one million, one hundred sixty thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •