Base | Representation |
---|---|
bin | 111000011001111111… |
… | …0011110101101110001 |
3 | 102120122211112111102121 |
4 | 1300303332132231301 |
5 | 3441034030213131 |
6 | 131351415514241 |
7 | 11515512241036 |
oct | 1606376365561 |
9 | 376584474377 |
10 | 121131101041 |
11 | 4740a392075 |
12 | 1b586688981 |
13 | b565637222 |
14 | 5c1165d38d |
15 | 323e431911 |
hex | 1c33f9eb71 |
121131101041 has 4 divisors (see below), whose sum is σ = 121161229684. Its totient is φ = 121100972400.
The previous prime is 121131100973. The next prime is 121131101057. The reversal of 121131101041 is 140101131121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 66923620416 + 54207480625 = 258696^2 + 232825^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121131101041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121131104041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15058290 + ... + 15066331.
It is an arithmetic number, because the mean of its divisors is an integer number (30290307421).
Almost surely, 2121131101041 is an apocalyptic number.
It is an amenable number.
121131101041 is a deficient number, since it is larger than the sum of its proper divisors (30128643).
121131101041 is an equidigital number, since it uses as much as digits as its factorization.
121131101041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30128642.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 121131101041 its reverse (140101131121), we get a palindrome (261232232162).
The spelling of 121131101041 in words is "one hundred twenty-one billion, one hundred thirty-one million, one hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •