Base | Representation |
---|---|
bin | 1011001000000011111101… |
… | …1000110000010110101011 |
3 | 1121022110211212220002000100 |
4 | 2302000333120300112223 |
5 | 3100411422330010011 |
6 | 42003453353440443 |
7 | 2401546241664510 |
oct | 262007730602653 |
9 | 47273755802010 |
10 | 12233130313131 |
11 | 3997050165682 |
12 | 1456a42710123 |
13 | 6a976b783530 |
14 | 30412db53307 |
15 | 163329c03d56 |
hex | b203f6305ab |
12233130313131 has 144 divisors (see below), whose sum is σ = 23013422664960. Its totient is φ = 6096842317440.
The previous prime is 12233130313067. The next prime is 12233130313147. The reversal of 12233130313131 is 13131303133221.
12233130313131 is a `hidden beast` number, since 1 + 2 + 2 + 3 + 313 + 0 + 31 + 313 + 1 = 666.
It is not a de Polignac number, because 12233130313131 - 26 = 12233130313067 is a prime.
It is a super-2 number, since 2×122331303131312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12233130313095 and 12233130313104.
It is not an unprimeable number, because it can be changed into a prime (12233130323131) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 112000176 + ... + 112109346.
Almost surely, 212233130313131 is an apocalyptic number.
12233130313131 is a deficient number, since it is larger than the sum of its proper divisors (10780292351829).
12233130313131 is a wasteful number, since it uses less digits than its factorization.
12233130313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109614 (or 109592 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
Adding to 12233130313131 its reverse (13131303133221), we get a palindrome (25364433446352).
The spelling of 12233130313131 in words is "twelve trillion, two hundred thirty-three billion, one hundred thirty million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •