Base | Representation |
---|---|
bin | 1011111011101100010011… |
… | …0100100011010010000001 |
3 | 1201110021100120111020102022 |
4 | 2332323010310203102001 |
5 | 3204430012322413241 |
6 | 43523145555131225 |
7 | 2522620051622642 |
oct | 276730464432201 |
9 | 51407316436368 |
10 | 13120132232321 |
11 | 41a9242670a24 |
12 | 157a9298a3b15 |
13 | 7422b939035a |
14 | 335036b4d6c9 |
15 | 17b44105c54b |
hex | beec4d23481 |
13120132232321 has 4 divisors (see below), whose sum is σ = 13120614990000. Its totient is φ = 13119649474644.
The previous prime is 13120132232203. The next prime is 13120132232351. The reversal of 13120132232321 is 12323223102131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13120132232321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13120132232351) 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, 241338071 + ... + 241392428.
It is an arithmetic number, because the mean of its divisors is an integer number (3280153747500).
Almost surely, 213120132232321 is an apocalyptic number.
It is an amenable number.
13120132232321 is a deficient number, since it is larger than the sum of its proper divisors (482757679).
13120132232321 is an equidigital number, since it uses as much as digits as its factorization.
13120132232321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482757678.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 13120132232321 its reverse (12323223102131), we get a palindrome (25443355334452).
The spelling of 13120132232321 in words is "thirteen trillion, one hundred twenty billion, one hundred thirty-two million, two hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •