Base | Representation |
---|---|
bin | 1011001101000111101100… |
… | …0101110010110011110011 |
3 | 1121121210011011110200120121 |
4 | 2303101323011302303303 |
5 | 3103322411004240311 |
6 | 42111424431551111 |
7 | 2411043601242526 |
oct | 263217305626363 |
9 | 47553134420517 |
10 | 12320031321331 |
11 | 3a1a994553318 |
12 | 146b85568b497 |
13 | 6b4a0a541646 |
14 | 30841523abbd |
15 | 165713e85b71 |
hex | b347b172cf3 |
12320031321331 has 16 divisors (see below), whose sum is σ = 12543559820064. Its totient is φ = 12097992536064.
The previous prime is 12320031321289. The next prime is 12320031321361. The reversal of 12320031321331 is 13312313002321.
It is a cyclic number.
It is not a de Polignac number, because 12320031321331 - 227 = 12319897103603 is a prime.
It is a super-2 number, since 2×123200313213312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12320031321296 and 12320031321305.
It is not an unprimeable number, because it can be changed into a prime (12320031321361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 230224080 + ... + 230277586.
It is an arithmetic number, because the mean of its divisors is an integer number (783972488754).
Almost surely, 212320031321331 is an apocalyptic number.
12320031321331 is a deficient number, since it is larger than the sum of its proper divisors (223528498733).
12320031321331 is a wasteful number, since it uses less digits than its factorization.
12320031321331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67350.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 12320031321331 its reverse (13312313002321), we get a palindrome (25632344323652).
The spelling of 12320031321331 in words is "twelve trillion, three hundred twenty billion, thirty-one million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •