Base | Representation |
---|---|
bin | 1011000001000101101010… |
… | …1111001101101111101111 |
3 | 1120220000121210122202021011 |
4 | 2300101122233031233233 |
5 | 3041431100001214411 |
6 | 41432441555250051 |
7 | 2360105416664632 |
oct | 260213257155757 |
9 | 46800553582234 |
10 | 12113330101231 |
11 | 3950264059297 |
12 | 14377898a9927 |
13 | 69b388aaab98 |
14 | 2dc407175c19 |
15 | 160167564c21 |
hex | b045abcdbef |
12113330101231 has 8 divisors (see below), whose sum is σ = 12166184304144. Its totient is φ = 12060483297600.
The previous prime is 12113330101193. The next prime is 12113330101237. The reversal of 12113330101231 is 13210103331121.
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 12113330101231 - 211 = 12113330099183 is a prime.
It is a super-2 number, since 2×121133301012312 (a number of 27 digits) contains 22 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 (12113330101237) 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, 1444281 + ... + 5129581.
It is an arithmetic number, because the mean of its divisors is an integer number (1520773038018).
Almost surely, 212113330101231 is an apocalyptic number.
12113330101231 is a deficient number, since it is larger than the sum of its proper divisors (52854202913).
12113330101231 is a wasteful number, since it uses less digits than its factorization.
12113330101231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3699641.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 12113330101231 its reverse (13210103331121), we get a palindrome (25323433432352).
The spelling of 12113330101231 in words is "twelve trillion, one hundred thirteen billion, three hundred thirty million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •