Base | Representation |
---|---|
bin | 1011001101001000110100… |
… | …0101110101010001100000 |
3 | 1121121210221012201212200002 |
4 | 2303102031011311101200 |
5 | 3103324020312240222 |
6 | 42111514420515132 |
7 | 2411054226222122 |
oct | 263221505652140 |
9 | 47553835655602 |
10 | 12320333321312 |
11 | 3a20029a73385 |
12 | 146b91a84baa8 |
13 | 6b4a57c8c863 |
14 | 3084433b1212 |
15 | 16573073c392 |
hex | b348d175460 |
12320333321312 has 48 divisors (see below), whose sum is σ = 25411088005632. Its totient is φ = 5868857808000.
The previous prime is 12320333321239. The next prime is 12320333321353. The reversal of 12320333321312 is 21312333302321.
It is a super-2 number, since 2×123203333213122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33161048 + ... + 33530519.
It is an arithmetic number, because the mean of its divisors is an integer number (529397666784).
Almost surely, 212320333321312 is an apocalyptic number.
It is an amenable number.
12320333321312 is an abundant number, since it is smaller than the sum of its proper divisors (13090754684320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12320333321312 is a wasteful number, since it uses less digits than its factorization.
12320333321312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66691851 (or 66691843 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 12320333321312 its reverse (21312333302321), we get a palindrome (33632666623633).
The spelling of 12320333321312 in words is "twelve trillion, three hundred twenty billion, three hundred thirty-three million, three hundred twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •