Base | Representation |
---|---|
bin | 1110011111101… |
… | …01011000010100 |
3 | 22110210110221002 |
4 | 13033311120110 |
5 | 222111410231 |
6 | 20022042432 |
7 | 3004336430 |
oct | 717653024 |
9 | 273713832 |
10 | 121591316 |
11 | 626a93a0 |
12 | 34879418 |
13 | 1c263332 |
14 | 122119c0 |
15 | aa1c0cb |
hex | 73f5614 |
121591316 has 48 divisors (see below), whose sum is σ = 274458240. Its totient is φ = 45736320.
The previous prime is 121591313. The next prime is 121591321. The reversal of 121591316 is 613195121.
It is a super-2 number, since 2×1215913162 = 29568896253223712, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121591313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2126 + ... + 15738.
It is an arithmetic number, because the mean of its divisors is an integer number (5717880).
Almost surely, 2121591316 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121591316, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137229120).
121591316 is an abundant number, since it is smaller than the sum of its proper divisors (152866924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121591316 is a wasteful number, since it uses less digits than its factorization.
121591316 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13664 (or 13662 counting only the distinct ones).
The product of its digits is 1620, while the sum is 29.
The square root of 121591316 is about 11026.8452424073. The cubic root of 121591316 is about 495.4131380677.
The spelling of 121591316 in words is "one hundred twenty-one million, five hundred ninety-one thousand, three hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •