Base | Representation |
---|---|
bin | 1110011110101… |
… | …10011011001101 |
3 | 22110120001000010 |
4 | 13033112123031 |
5 | 222043331100 |
6 | 20015223433 |
7 | 3003300660 |
oct | 717263315 |
9 | 273501003 |
10 | 121464525 |
11 | 62622106 |
12 | 34817b79 |
13 | 1c21a700 |
14 | 121bb6d7 |
15 | a9e4750 |
hex | 73d66cd |
121464525 has 108 divisors (see below), whose sum is σ = 255421152. Its totient is φ = 49870080.
The previous prime is 121464521. The next prime is 121464559. The reversal of 121464525 is 525464121.
It is not a de Polignac number, because 121464525 - 22 = 121464521 is a prime.
Its product of digits (9600) is a multiple of the sum of its prime factors (120).
It is a junction number, because it is equal to n+sod(n) for n = 121464492 and 121464501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121464521) 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 107 ways as a sum of consecutive naturals, for example, 3282807 + ... + 3282843.
Almost surely, 2121464525 is an apocalyptic number.
121464525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
121464525 is an abundant number, since it is smaller than the sum of its proper divisors (133956627).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121464525 is a wasteful number, since it uses less digits than its factorization.
121464525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120 (or 65 counting only the distinct ones).
The product of its digits is 9600, while the sum is 30.
The square root of 121464525 is about 11021.0945463688. The cubic root of 121464525 is about 495.2408785806.
The spelling of 121464525 in words is "one hundred twenty-one million, four hundred sixty-four thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •