Base | Representation |
---|---|
bin | 1011111011110000101010… |
… | …1010100111101110100101 |
3 | 1201110101101020102221102101 |
4 | 2332330022222213232211 |
5 | 3204434412313043323 |
6 | 43523502135012101 |
7 | 2522661101025664 |
oct | 276741252475645 |
9 | 51411336387371 |
10 | 13121304034213 |
11 | 41a9794068041 |
12 | 157abb620a031 |
13 | 742445090a5b |
14 | 33510861cddb |
15 | 17b4add77dad |
hex | bef0aaa7ba5 |
13121304034213 has 4 divisors (see below), whose sum is σ = 13400480715840. Its totient is φ = 12842127352588.
The previous prime is 13121304034193. The next prime is 13121304034219. The reversal of 13121304034213 is 31243040312131.
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-13121304034213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13121304034219) 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, 139588340743 + ... + 139588340836.
It is an arithmetic number, because the mean of its divisors is an integer number (3350120178960).
Almost surely, 213121304034213 is an apocalyptic number.
It is an amenable number.
13121304034213 is a deficient number, since it is larger than the sum of its proper divisors (279176681627).
13121304034213 is an equidigital number, since it uses as much as digits as its factorization.
13121304034213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 279176681626.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 13121304034213 its reverse (31243040312131), we get a palindrome (44364344346344).
The spelling of 13121304034213 in words is "thirteen trillion, one hundred twenty-one billion, three hundred four million, thirty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •