Base | Representation |
---|---|
bin | 1011000010000100100110… |
… | …0101111101110110001011 |
3 | 1120221122020001101001101210 |
4 | 2300201021211331312023 |
5 | 3042220143404131243 |
6 | 41444314110344203 |
7 | 2361244134411663 |
oct | 260411145756613 |
9 | 46848201331353 |
10 | 12130222333323 |
11 | 3957442300286 |
12 | 143ab02abb063 |
13 | 69cb4b66aba3 |
14 | 2dd16a8011a3 |
15 | 160805550933 |
hex | b084997dd8b |
12130222333323 has 8 divisors (see below), whose sum is σ = 16183027593936. Its totient is φ = 8082115980800.
The previous prime is 12130222333291. The next prime is 12130222333331. The reversal of 12130222333323 is 32333322203121.
12130222333323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12130222333323 - 25 = 12130222333291 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12130222333343) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1174720998 + ... + 1174731323.
It is an arithmetic number, because the mean of its divisors is an integer number (2022878449242).
Almost surely, 212130222333323 is an apocalyptic number.
12130222333323 is a deficient number, since it is larger than the sum of its proper divisors (4052805260613).
12130222333323 is a wasteful number, since it uses less digits than its factorization.
12130222333323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2349454045.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 12130222333323 its reverse (32333322203121), we get a palindrome (44463544536444).
The spelling of 12130222333323 in words is "twelve trillion, one hundred thirty billion, two hundred twenty-two million, three hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •