Base | Representation |
---|---|
bin | 1110011110111… |
… | …11110100100100 |
3 | 22110121222210120 |
4 | 13033133310210 |
5 | 222101044022 |
6 | 20020121540 |
7 | 3003521121 |
oct | 717376444 |
9 | 273558716 |
10 | 121503012 |
11 | 62649014 |
12 | 348362b0 |
13 | 1c232097 |
14 | 121cb748 |
15 | aa00d5c |
hex | 73dfd24 |
121503012 has 48 divisors (see below), whose sum is σ = 309883392. Its totient is φ = 36887040.
The previous prime is 121502999. The next prime is 121503017. The reversal of 121503012 is 210305121.
It is a junction number, because it is equal to n+sod(n) for n = 121502982 and 121503000.
It is not an unprimeable number, because it can be changed into a prime (121503017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3283 + ... + 15930.
It is an arithmetic number, because the mean of its divisors is an integer number (6455904).
Almost surely, 2121503012 is an apocalyptic number.
121503012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121503012 is an abundant number, since it is smaller than the sum of its proper divisors (188380380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121503012 is a wasteful number, since it uses less digits than its factorization.
121503012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19268 (or 19266 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 121503012 is about 11022.8404687721. The cubic root of 121503012 is about 495.2931800596.
Adding to 121503012 its reverse (210305121), we get a palindrome (331808133).
The spelling of 121503012 in words is "one hundred twenty-one million, five hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •