Base | Representation |
---|---|
bin | 111000011111000111… |
… | …0010000111111101111 |
3 | 102121002211000102222122 |
4 | 1300332032100333233 |
5 | 3441412032330221 |
6 | 131420440303155 |
7 | 11523000404126 |
oct | 1607616207757 |
9 | 377084012878 |
10 | 121303011311 |
11 | 47498429879 |
12 | 1b614171abb |
13 | b592137b91 |
14 | 5c2a40cabd |
15 | 324e58ceab |
hex | 1c3e390fef |
121303011311 has 8 divisors (see below), whose sum is σ = 125490615120. Its totient is φ = 117115723648.
The previous prime is 121303011299. The next prime is 121303011331. The reversal of 121303011311 is 113110303121.
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 121303011311 - 218 = 121302749167 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121303011311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121303011331) 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, 912680 + ... + 1037106.
It is an arithmetic number, because the mean of its divisors is an integer number (15686326890).
Almost surely, 2121303011311 is an apocalyptic number.
121303011311 is a deficient number, since it is larger than the sum of its proper divisors (4187603809).
121303011311 is a wasteful number, since it uses less digits than its factorization.
121303011311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158073.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 121303011311 its reverse (113110303121), we get a palindrome (234413314432).
The spelling of 121303011311 in words is "one hundred twenty-one billion, three hundred three million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •