Base | Representation |
---|---|
bin | 1011000000011100100101… |
… | …1011001110111100000100 |
3 | 1120211222011020202222002000 |
4 | 2300013021123032330010 |
5 | 3041241003332413244 |
6 | 41423415413545300 |
7 | 2356235221440423 |
oct | 260071133167404 |
9 | 46758136688060 |
10 | 12102302232324 |
11 | 3946615116147 |
12 | 1435610645230 |
13 | 69a31c176575 |
14 | 2dba7c6cd2ba |
15 | 15ec1e31d169 |
hex | b01c96cef04 |
12102302232324 has 48 divisors (see below), whose sum is σ = 32388479101440. Its totient is φ = 3903968460960.
The previous prime is 12102302232323. The next prime is 12102302232347. The reversal of 12102302232324 is 42323220320121.
12102302232324 is a `hidden beast` number, since 1 + 2 + 1 + 0 + 2 + 302 + 2 + 32 + 324 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (12102302232323) 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, 1807389459 + ... + 1807396154.
It is an arithmetic number, because the mean of its divisors is an integer number (674759981280).
Almost surely, 212102302232324 is an apocalyptic number.
It is an amenable number.
12102302232324 is an abundant number, since it is smaller than the sum of its proper divisors (20286176869116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12102302232324 is a wasteful number, since it uses less digits than its factorization.
12102302232324 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3614785657 (or 3614785649 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 12102302232324 its reverse (42323220320121), we get a palindrome (54425522552445).
The spelling of 12102302232324 in words is "twelve trillion, one hundred two billion, three hundred two million, two hundred thirty-two thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •