Base | Representation |
---|---|
bin | 1100000111011001011100… |
… | …1111111101111000001011 |
3 | 1202011111102111112201022022 |
4 | 3001312113033331320023 |
5 | 3221223340132130443 |
6 | 44155404502315055 |
7 | 2543266345222430 |
oct | 301662717757013 |
9 | 52144374481268 |
10 | 13321231130123 |
11 | 4276558764324 |
12 | 15b18b1428a8b |
13 | 7582572655c7 |
14 | 340a72b63b87 |
15 | 1817b0beae68 |
hex | c1d973fde0b |
13321231130123 has 4 divisors (see below), whose sum is σ = 15224264148720. Its totient is φ = 11418198111528.
The previous prime is 13321231130087. The next prime is 13321231130167. The reversal of 13321231130123 is 32103113212331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13321231130123 - 28 = 13321231129867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13321231130092 and 13321231130101.
It is not an unprimeable number, because it can be changed into a prime (13321231130923) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 951516509288 + ... + 951516509301.
It is an arithmetic number, because the mean of its divisors is an integer number (3806066037180).
Almost surely, 213321231130123 is an apocalyptic number.
13321231130123 is a deficient number, since it is larger than the sum of its proper divisors (1903033018597).
13321231130123 is an equidigital number, since it uses as much as digits as its factorization.
13321231130123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1903033018596.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 13321231130123 its reverse (32103113212331), we get a palindrome (45424344342454).
The spelling of 13321231130123 in words is "thirteen trillion, three hundred twenty-one billion, two hundred thirty-one million, one hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •