Base | Representation |
---|---|
bin | 1110011100011… |
… | …00000010010111 |
3 | 22102222120001011 |
4 | 13032030002113 |
5 | 222004103311 |
6 | 20004513051 |
7 | 3000561442 |
oct | 716140227 |
9 | 272876034 |
10 | 121159831 |
11 | 624341a1 |
12 | 346ab787 |
13 | 1c141b10 |
14 | 1213c659 |
15 | a984321 |
hex | 738c097 |
121159831 has 8 divisors (see below), whose sum is σ = 132053040. Its totient is φ = 110491392.
The previous prime is 121159817. The next prime is 121159849. The reversal of 121159831 is 138951121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121159831 - 29 = 121159319 is a prime.
It is a super-2 number, since 2×1211598312 = 29359409295897122, which contains 22 as substring.
It is a Duffinian number.
It is a nialpdrome in base 15.
It is a junction number, because it is equal to n+sod(n) for n = 121159793 and 121159802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121159861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55066 + ... + 57223.
It is an arithmetic number, because the mean of its divisors is an integer number (16506630).
Almost surely, 2121159831 is an apocalyptic number.
121159831 is a deficient number, since it is larger than the sum of its proper divisors (10893209).
121159831 is a wasteful number, since it uses less digits than its factorization.
121159831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112385.
The product of its digits is 2160, while the sum is 31.
The square root of 121159831 is about 11007.2626479066. The cubic root of 121159831 is about 494.8264275973.
The spelling of 121159831 in words is "one hundred twenty-one million, one hundred fifty-nine thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •