Base | Representation |
---|---|
bin | 1011001101101101111101… |
… | …0001110100110000010101 |
3 | 1121122202122221210220000220 |
4 | 2303123133101310300111 |
5 | 3104004424321144341 |
6 | 42120243531024553 |
7 | 2411556244550634 |
oct | 263333721646025 |
9 | 47582587726026 |
10 | 12330302131221 |
11 | 3a24285114858 |
12 | 147184129b159 |
13 | 6b5986379449 |
14 | 308b0b33551b |
15 | 165b159d8a66 |
hex | b36df474c15 |
12330302131221 has 8 divisors (see below), whose sum is σ = 16440465853344. Its totient is φ = 8220169914960.
The previous prime is 12330302131183. The next prime is 12330302131237. The reversal of 12330302131221 is 12213120303321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12330302131221 - 210 = 12330302130197 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12330302131191 and 12330302131200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12330302131291) 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, 6947631 + ... + 8539916.
It is an arithmetic number, because the mean of its divisors is an integer number (2055058231668).
Almost surely, 212330302131221 is an apocalyptic number.
It is an amenable number.
12330302131221 is a deficient number, since it is larger than the sum of its proper divisors (4110163722123).
12330302131221 is a wasteful number, since it uses less digits than its factorization.
12330302131221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15752931.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 12330302131221 its reverse (12213120303321), we get a palindrome (24543422434542).
The spelling of 12330302131221 in words is "twelve trillion, three hundred thirty billion, three hundred two million, one hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •