Base | Representation |
---|---|
bin | 1011000010001000101100… |
… | …0110001111011101100001 |
3 | 1120221202001122022000021021 |
4 | 2300202023012033131201 |
5 | 3042224421224004441 |
6 | 41445015125325441 |
7 | 2361313310525503 |
oct | 260421306173541 |
9 | 46852048260237 |
10 | 12131321313121 |
11 | 395795668904a |
12 | 143b16ab66881 |
13 | 69cc952523aa |
14 | 2dd232755d73 |
15 | 16086bc843d1 |
hex | b088b18f761 |
12131321313121 has 8 divisors (see below), whose sum is σ = 12172787211200. Its totient is φ = 12089868079248.
The previous prime is 12131321313119. The next prime is 12131321313193. The reversal of 12131321313121 is 12131312313121.
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 12131321313121 - 21 = 12131321313119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12131321313521) 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, 1244946 + ... + 5080603.
It is an arithmetic number, because the mean of its divisors is an integer number (1521598401400).
Almost surely, 212131321313121 is an apocalyptic number.
It is an amenable number.
12131321313121 is a deficient number, since it is larger than the sum of its proper divisors (41465898079).
12131321313121 is an equidigital number, since it uses as much as digits as its factorization.
12131321313121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6332103.
The product of its digits is 648, while the sum is 25.
Adding to 12131321313121 its reverse (12131312313121), we get a palindrome (24262633626242).
Subtracting from 12131321313121 its reverse (12131312313121), we obtain a square (9000000 = 30002).
The spelling of 12131321313121 in words is "twelve trillion, one hundred thirty-one billion, three hundred twenty-one million, three hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •