Base | Representation |
---|---|
bin | 1100001110011000000100… |
… | …1100001101100011110001 |
3 | 1202120221212202212000001201 |
4 | 3003212001030031203301 |
5 | 3230204403223200223 |
6 | 44330433151531201 |
7 | 2555042326013230 |
oct | 303460114154361 |
9 | 52527782760051 |
10 | 13441120131313 |
11 | 431238a9a5396 |
12 | 1610b8bb29b01 |
13 | 766652457ab4 |
14 | 3467a7454b17 |
15 | 18497b077ead |
hex | c398130d8f1 |
13441120131313 has 8 divisors (see below), whose sum is σ = 15413707729728. Its totient is φ = 11481639427824.
The previous prime is 13441120131269. The next prime is 13441120131317. The reversal of 13441120131313 is 31313102114431.
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 13441120131313 - 213 = 13441120123121 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13441120131317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3276721531 + ... + 3276725632.
It is an arithmetic number, because the mean of its divisors is an integer number (1926713466216).
Almost surely, 213441120131313 is an apocalyptic number.
It is an amenable number.
13441120131313 is a deficient number, since it is larger than the sum of its proper divisors (1972587598415).
13441120131313 is an equidigital number, since it uses as much as digits as its factorization.
13441120131313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6553447463.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 13441120131313 its reverse (31313102114431), we get a palindrome (44754222245744).
The spelling of 13441120131313 in words is "thirteen trillion, four hundred forty-one billion, one hundred twenty million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •