Base | Representation |
---|---|
bin | 111000011111010101… |
… | …0001001011011001011 |
3 | 102121010022202210002002 |
4 | 1300332222021123023 |
5 | 3441420420222311 |
6 | 131421301101215 |
7 | 11523116465204 |
oct | 1607652113313 |
9 | 377108683062 |
10 | 121310320331 |
11 | 474a1571192 |
12 | 1b6166b780b |
13 | b5937c6945 |
14 | 5c2b3925ab |
15 | 325003393b |
hex | 1c3ea896cb |
121310320331 has 8 divisors (see below), whose sum is σ = 123031786464. Its totient is φ = 119589211840.
The previous prime is 121310320301. The next prime is 121310320361. The reversal of 121310320331 is 133023013121.
It is an interprime number because it is at equal distance from previous prime (121310320301) and next prime (121310320361).
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 121310320331 - 230 = 120236578507 is a prime.
It is a super-2 number, since 2×1213103203312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121310320301) 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, 635135 + ... + 803751.
It is an arithmetic number, because the mean of its divisors is an integer number (15378973308).
Almost surely, 2121310320331 is an apocalyptic number.
121310320331 is a deficient number, since it is larger than the sum of its proper divisors (1721466133).
121310320331 is a wasteful number, since it uses less digits than its factorization.
121310320331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178821.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 121310320331 its reverse (133023013121), we get a palindrome (254333333452).
The spelling of 121310320331 in words is "one hundred twenty-one billion, three hundred ten million, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •