Base | Representation |
---|---|
bin | 111000011111010110… |
… | …1100011010111100111 |
3 | 102121010101110010122001 |
4 | 1300332231203113213 |
5 | 3441421132304111 |
6 | 131421332150131 |
7 | 11523130203631 |
oct | 1607655432747 |
9 | 377111403561 |
10 | 121311213031 |
11 | 474a2020958 |
12 | 1b616a68347 |
13 | b593a4a078 |
14 | 5c2b545a51 |
15 | 325015d1c1 |
hex | 1c3eb635e7 |
121311213031 has 8 divisors (see below), whose sum is σ = 121965168384. Its totient is φ = 120657454080.
The previous prime is 121311213011. The next prime is 121311213077. The reversal of 121311213031 is 130312113121.
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 121311213031 - 211 = 121311210983 is a prime.
It is a super-2 number, since 2×1213112130312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121311213011) 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 7 ways as a sum of consecutive naturals, for example, 1287091 + ... + 1378123.
It is an arithmetic number, because the mean of its divisors is an integer number (15245646048).
Almost surely, 2121311213031 is an apocalyptic number.
121311213031 is a deficient number, since it is larger than the sum of its proper divisors (653955353).
121311213031 is an equidigital number, since it uses as much as digits as its factorization.
121311213031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98201.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 121311213031 its reverse (130312113121), we get a palindrome (251623326152).
The spelling of 121311213031 in words is "one hundred twenty-one billion, three hundred eleven million, two hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •