Base | Representation |
---|---|
bin | 111000011010100111… |
… | …0100101111100000101 |
3 | 102120201022001110112102 |
4 | 1300311032211330011 |
5 | 3441104414232044 |
6 | 131353450001445 |
7 | 11516155606541 |
oct | 1606516457405 |
9 | 376638043472 |
10 | 121152102149 |
11 | 47420226561 |
12 | 1b591716285 |
13 | b569aab210 |
14 | 5c14368a21 |
15 | 32411ce24e |
hex | 1c353a5f05 |
121152102149 has 8 divisors (see below), whose sum is σ = 131041242360. Its totient is φ = 111344354496.
The previous prime is 121152102139. The next prime is 121152102163. The reversal of 121152102149 is 941201251121.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 6441186049 + 114710916100 = 80257^2 + 338690^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121152102149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121152102109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20345042 + ... + 20350995.
It is an arithmetic number, because the mean of its divisors is an integer number (16380155295).
Almost surely, 2121152102149 is an apocalyptic number.
It is an amenable number.
121152102149 is a deficient number, since it is larger than the sum of its proper divisors (9889140211).
121152102149 is a wasteful number, since it uses less digits than its factorization.
121152102149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40696279.
The product of its (nonzero) digits is 1440, while the sum is 29.
The spelling of 121152102149 in words is "one hundred twenty-one billion, one hundred fifty-two million, one hundred two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •