Base | Representation |
---|---|
bin | 111000011010000001… |
… | …0010111110001111101 |
3 | 102120122220110022211202 |
4 | 1300310002113301331 |
5 | 3441034310334323 |
6 | 131351453425245 |
7 | 11515524020225 |
oct | 1606402276175 |
9 | 376586408752 |
10 | 121132121213 |
11 | 4740aa19594 |
12 | 1b586a9b225 |
13 | b56590368c |
14 | 5c11847085 |
15 | 323e583d28 |
hex | 1c34097c7d |
121132121213 has 16 divisors (see below), whose sum is σ = 127774551600. Its totient is φ = 114657553920.
The previous prime is 121132121207. The next prime is 121132121239. The reversal of 121132121213 is 312121231121.
It can be written as a sum of positive squares in 8 ways, for example, as 37047780484 + 84084340729 = 192478^2 + 289973^2 .
It is a cyclic number.
It is not a de Polignac number, because 121132121213 - 24 = 121132121197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121132121263) 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 15 ways as a sum of consecutive naturals, for example, 1950623 + ... + 2011763.
It is an arithmetic number, because the mean of its divisors is an integer number (7985909475).
Almost surely, 2121132121213 is an apocalyptic number.
It is an amenable number.
121132121213 is a deficient number, since it is larger than the sum of its proper divisors (6642430387).
121132121213 is a wasteful number, since it uses less digits than its factorization.
121132121213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62512.
The product of its digits is 144, while the sum is 20.
Adding to 121132121213 its reverse (312121231121), we get a palindrome (433253352334).
The spelling of 121132121213 in words is "one hundred twenty-one billion, one hundred thirty-two million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •