Base | Representation |
---|---|
bin | 1011000110101110010010… |
… | …0010100110001111011101 |
3 | 1121020021111001020200022210 |
4 | 2301223210202212033131 |
5 | 3100022322110030023 |
6 | 41545131253431033 |
7 | 2400103302601551 |
oct | 261534442461735 |
9 | 47207431220283 |
10 | 12210131330013 |
11 | 3988318900211 |
12 | 14524a433b479 |
13 | 6a754498c196 |
14 | 302d8b44b861 |
15 | 162930a45593 |
hex | b1ae48a63dd |
12210131330013 has 8 divisors (see below), whose sum is σ = 16280237056608. Its totient is φ = 8140056578384.
The previous prime is 12210131330011. The next prime is 12210131330029. The reversal of 12210131330013 is 31003313101221.
It is a happy number.
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 12210131330013 - 21 = 12210131330011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210131330011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6807795 + ... + 8412272.
It is an arithmetic number, because the mean of its divisors is an integer number (2035029632076).
Almost surely, 212210131330013 is an apocalyptic number.
It is an amenable number.
12210131330013 is a deficient number, since it is larger than the sum of its proper divisors (4070105726595).
12210131330013 is a wasteful number, since it uses less digits than its factorization.
12210131330013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15487483.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 12210131330013 its reverse (31003313101221), we get a palindrome (43213444431234).
The spelling of 12210131330013 in words is "twelve trillion, two hundred ten billion, one hundred thirty-one million, three hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •