Base | Representation |
---|---|
bin | 111000011111011010… |
… | …1001010111111000111 |
3 | 102121010112012121101101 |
4 | 1300332311022333013 |
5 | 3441422140212221 |
6 | 131421443040531 |
7 | 11523153162616 |
oct | 1607665127707 |
9 | 377115177341 |
10 | 121313210311 |
11 | 474a31654a7 |
12 | 1b617670147 |
13 | b5942991a7 |
14 | 5c2b90587d |
15 | 3250404d91 |
hex | 1c3ed4afc7 |
121313210311 has 8 divisors (see below), whose sum is σ = 121998784544. Its totient is φ = 120627804960.
The previous prime is 121313210287. The next prime is 121313210357. The reversal of 121313210311 is 113012313121.
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 121313210311 - 25 = 121313210279 is a prime.
It is a super-3 number, since 3×1213132103113 (a number of 34 digits) contains 333 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 (121413210311) 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, 1571950 + ... + 1647316.
It is an arithmetic number, because the mean of its divisors is an integer number (15249848068).
Almost surely, 2121313210311 is an apocalyptic number.
121313210311 is a deficient number, since it is larger than the sum of its proper divisors (685574233).
121313210311 is an equidigital number, since it uses as much as digits as its factorization.
121313210311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84441.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 121313210311 its reverse (113012313121), we get a palindrome (234325523432).
The spelling of 121313210311 in words is "one hundred twenty-one billion, three hundred thirteen million, two hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •