Base | Representation |
---|---|
bin | 1110011100010… |
… | …10110110111000 |
3 | 22102222022102020 |
4 | 13032022312320 |
5 | 222003430000 |
6 | 20004434440 |
7 | 3000541401 |
oct | 716126670 |
9 | 272868366 |
10 | 121155000 |
11 | 624305aa |
12 | 346a8a20 |
13 | 1c13c865 |
14 | 1213a9a8 |
15 | a982ba0 |
hex | 738adb8 |
121155000 has 160 divisors (see below), whose sum is σ = 389687760. Its totient is φ = 31360000.
The previous prime is 121154987. The next prime is 121155043. The reversal of 121155000 is 551121.
It is a super-4 number, since 4×1211550004 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 614902 + ... + 615098.
Almost surely, 2121155000 is an apocalyptic number.
121155000 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 121155000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194843880).
121155000 is an abundant number, since it is smaller than the sum of its proper divisors (268532760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121155000 is a wasteful number, since it uses less digits than its factorization.
121155000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267 (or 248 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 121155000 is about 11007.0431996972. The cubic root of 121155000 is about 494.8198507799.
The spelling of 121155000 in words is "one hundred twenty-one million, one hundred fifty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •