Base | Representation |
---|---|
bin | 1110011110111… |
… | …11110110101110 |
3 | 22110121222222200 |
4 | 13033133312232 |
5 | 222101100100 |
6 | 20020122330 |
7 | 3003521406 |
oct | 717376656 |
9 | 273558880 |
10 | 121503150 |
11 | 6264912a |
12 | 348363a6 |
13 | 1c232172 |
14 | 121cb806 |
15 | aa00e00 |
hex | 73dfdae |
121503150 has 72 divisors (see below), whose sum is σ = 328364400. Its totient is φ = 32209920.
The previous prime is 121503139. The next prime is 121503163. The reversal of 121503150 is 51305121.
121503150 is a `hidden beast` number, since 12 + 1 + 503 + 150 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 86151 + ... + 87549.
Almost surely, 2121503150 is an apocalyptic number.
121503150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 121503150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164182200).
121503150 is an abundant number, since it is smaller than the sum of its proper divisors (206861250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121503150 is a wasteful number, since it uses less digits than its factorization.
121503150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1610 (or 1602 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 121503150 is about 11022.8467284999. The cubic root of 121503150 is about 495.2933675733.
Adding to 121503150 its reverse (51305121), we get a palindrome (172808271).
The spelling of 121503150 in words is "one hundred twenty-one million, five hundred three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •