Base | Representation |
---|---|
bin | 111000011001001010… |
… | …0001010100010011011 |
3 | 102120120220002120002201 |
4 | 1300302110022202123 |
5 | 3441004411344011 |
6 | 131344542311031 |
7 | 11515023323461 |
oct | 1606224124233 |
9 | 376526076081 |
10 | 121103231131 |
11 | 473a5686a93 |
12 | 1b579288477 |
13 | b55c92995c |
14 | 5c0ba86831 |
15 | 323bc78cc1 |
hex | 1c3250a89b |
121103231131 has 8 divisors (see below), whose sum is σ = 123166384704. Its totient is φ = 119042589120.
The previous prime is 121103231107. The next prime is 121103231189. The reversal of 121103231131 is 131132301121.
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-121103231131 is a prime.
It is a super-2 number, since 2×1211032311312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121103231099 and 121103231108.
It is not an unprimeable number, because it can be changed into a prime (121103231731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 530506 + ... + 723631.
It is an arithmetic number, because the mean of its divisors is an integer number (15395798088).
Almost surely, 2121103231131 is an apocalyptic number.
121103231131 is a deficient number, since it is larger than the sum of its proper divisors (2063153573).
121103231131 is a wasteful number, since it uses less digits than its factorization.
121103231131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1255781.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 121103231131 its reverse (131132301121), we get a palindrome (252235532252).
The spelling of 121103231131 in words is "one hundred twenty-one billion, one hundred three million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •