Base | Representation |
---|---|
bin | 1011111011101101010100… |
… | …0010100011111001011001 |
3 | 1201110022001112111202102002 |
4 | 2332323111002203321121 |
5 | 3204431042002342223 |
6 | 43523232555250345 |
7 | 2522626564533464 |
oct | 276732502437131 |
9 | 51408045452362 |
10 | 13120404340313 |
11 | 41a9372224766 |
12 | 157a9a4a499b5 |
13 | 7423308737ba |
14 | 335060d422db |
15 | 17b459dabe28 |
hex | beed50a3e59 |
13120404340313 has 4 divisors (see below), whose sum is σ = 13220560098768. Its totient is φ = 13020248581860.
The previous prime is 13120404340291. The next prime is 13120404340357. The reversal of 13120404340313 is 31304340402131.
It is a happy number.
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 not a de Polignac number, because 13120404340313 - 26 = 13120404340249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13120404340363) 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, 50077879031 + ... + 50077879292.
It is an arithmetic number, because the mean of its divisors is an integer number (3305140024692).
Almost surely, 213120404340313 is an apocalyptic number.
It is an amenable number.
13120404340313 is a deficient number, since it is larger than the sum of its proper divisors (100155758455).
13120404340313 is a wasteful number, since it uses less digits than its factorization.
13120404340313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100155758454.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 13120404340313 its reverse (31304340402131), we get a palindrome (44424744742444).
The spelling of 13120404340313 in words is "thirteen trillion, one hundred twenty billion, four hundred four million, three hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •