Base | Representation |
---|---|
bin | 11011100101010011111101… |
… | …101110110111110111001111 |
3 | 120220112020200222222011222200 |
4 | 123211103331232313313033 |
5 | 111400031032141400221 |
6 | 1110001351542212543 |
7 | 34360311300556320 |
oct | 3345237556676717 |
9 | 526466628864880 |
10 | 121311313231311 |
11 | 35720925815545 |
12 | 11732b41424153 |
13 | 528c7b92ccb08 |
14 | 21d56dad44447 |
15 | e058bb88e426 |
hex | 6e54fdbb7dcf |
121311313231311 has 48 divisors (see below), whose sum is σ = 201205266862080. Its totient is φ = 68993833708800.
The previous prime is 121311313231271. The next prime is 121311313231411. The reversal of 121311313231311 is 113132313113121.
121311313231311 is a `hidden beast` number, since 1 + 2 + 1 + 3 + 1 + 1 + 313 + 2 + 31 + 311 = 666.
It is not a de Polignac number, because 121311313231311 - 219 = 121311312707023 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121311313231211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 26050986 + ... + 30352536.
It is an arithmetic number, because the mean of its divisors is an integer number (4191776392960).
Almost surely, 2121311313231311 is an apocalyptic number.
121311313231311 is a deficient number, since it is larger than the sum of its proper divisors (79893953630769).
121311313231311 is a wasteful number, since it uses less digits than its factorization.
121311313231311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4303676 (or 4303673 counting only the distinct ones).
The product of its digits is 972, while the sum is 27.
Adding to 121311313231311 its reverse (113132313113121), we get a palindrome (234443626344432).
The spelling of 121311313231311 in words is "one hundred twenty-one trillion, three hundred eleven billion, three hundred thirteen million, two hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •