Base | Representation |
---|---|
bin | 1110011110010… |
… | …10111010100100 |
3 | 22110110122100000 |
4 | 13033022322210 |
5 | 222040324010 |
6 | 20014221300 |
7 | 3003013350 |
oct | 717127244 |
9 | 273418300 |
10 | 121417380 |
11 | 6259a747 |
12 | 347b4830 |
13 | 1c202106 |
14 | 121a8460 |
15 | a9d57c0 |
hex | 73caea4 |
121417380 has 288 divisors, whose sum is σ = 452035584. Its totient is φ = 26780544.
The previous prime is 121417367. The next prime is 121417381. The reversal of 121417380 is 83714121.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (121417381) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1462819 + ... + 1462901.
It is an arithmetic number, because the mean of its divisors is an integer number (1569568).
Almost surely, 2121417380 is an apocalyptic number.
121417380 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 121417380, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (226017792).
121417380 is an abundant number, since it is smaller than the sum of its proper divisors (330618204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121417380 is a wasteful number, since it uses less digits than its factorization.
121417380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157 (or 143 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 121417380 is about 11018.9554858889. The cubic root of 121417380 is about 495.1767963513.
The spelling of 121417380 in words is "one hundred twenty-one million, four hundred seventeen thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •