Base | Representation |
---|---|
bin | 1011001101101101010001… |
… | …1011001000010101010011 |
3 | 1121122202012021010202020011 |
4 | 2303123110123020111103 |
5 | 3104004041211140311 |
6 | 42120213503455351 |
7 | 2411551603624210 |
oct | 263332433102523 |
9 | 47582167122204 |
10 | 12330120021331 |
11 | 3a241a1340a12 |
12 | 14717b02b7557 |
13 | 6b5957717108 |
14 | 308ad108cb07 |
15 | 165b04a15321 |
hex | b36d46c8553 |
12330120021331 has 16 divisors (see below), whose sum is σ = 14473053556416. Its totient is φ = 10282583494656.
The previous prime is 12330120021239. The next prime is 12330120021337. The reversal of 12330120021331 is 13312002103321.
12330120021331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12330120021331 - 29 = 12330120020819 is a prime.
It is a super-2 number, since 2×123301200213312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12330120021337) 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, 4939395 + ... + 7004131.
It is an arithmetic number, because the mean of its divisors is an integer number (904565847276).
Almost surely, 212330120021331 is an apocalyptic number.
12330120021331 is a deficient number, since it is larger than the sum of its proper divisors (2142933535085).
12330120021331 is a wasteful number, since it uses less digits than its factorization.
12330120021331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2087838.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12330120021331 its reverse (13312002103321), we get a palindrome (25642122124652).
The spelling of 12330120021331 in words is "twelve trillion, three hundred thirty billion, one hundred twenty million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •