Base | Representation |
---|---|
bin | 1100000111010101101110… |
… | …1110001010110001110001 |
3 | 1202011101211220021200210011 |
4 | 3001311123232022301301 |
5 | 3221214313444224241 |
6 | 44155121424334521 |
7 | 2543232530250520 |
oct | 301653356126161 |
9 | 52141756250704 |
10 | 13320232414321 |
11 | 4276095a38368 |
12 | 15b1672a74441 |
13 | 758128387b01 |
14 | 3409ba26c4b7 |
15 | 1817531c0281 |
hex | c1d5bb8ac71 |
13320232414321 has 48 divisors (see below), whose sum is σ = 15801694731648. Its totient is φ = 10998804602880.
The previous prime is 13320232414303. The next prime is 13320232414361. The reversal of 13320232414321 is 12341423202331.
It is not a de Polignac number, because 13320232414321 - 27 = 13320232414193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (13320232414301) 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 47 ways as a sum of consecutive naturals, for example, 1678241265 + ... + 1678249201.
It is an arithmetic number, because the mean of its divisors is an integer number (329201973576).
Almost surely, 213320232414321 is an apocalyptic number.
It is an amenable number.
13320232414321 is a deficient number, since it is larger than the sum of its proper divisors (2481462317327).
13320232414321 is an equidigital number, since it uses as much as digits as its factorization.
13320232414321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9110 (or 9079 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 13320232414321 its reverse (12341423202331), we get a palindrome (25661655616652).
The spelling of 13320232414321 in words is "thirteen trillion, three hundred twenty billion, two hundred thirty-two million, four hundred fourteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •