Base | Representation |
---|---|
bin | 1011111011010110111111… |
… | …1000011001110010001101 |
3 | 1201102201120221021001202102 |
4 | 2332311233320121302031 |
5 | 3204331304011230331 |
6 | 43520402223204445 |
7 | 2522325234346640 |
oct | 276655770316215 |
9 | 51381527231672 |
10 | 13114412211341 |
11 | 41a687788a561 |
12 | 15797b2146725 |
13 | 7418b730255c |
14 | 334a531c1a57 |
15 | 17b208ccb4cb |
hex | bed6fe19c8d |
13114412211341 has 4 divisors (see below), whose sum is σ = 14987899670112. Its totient is φ = 11240924752572.
The previous prime is 13114412211289. The next prime is 13114412211377. The reversal of 13114412211341 is 14311221441131.
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 13114412211341 - 222 = 13114408017037 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 (13114412211391) 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, 936743729375 + ... + 936743729388.
It is an arithmetic number, because the mean of its divisors is an integer number (3746974917528).
Almost surely, 213114412211341 is an apocalyptic number.
It is an amenable number.
13114412211341 is a deficient number, since it is larger than the sum of its proper divisors (1873487458771).
13114412211341 is an equidigital number, since it uses as much as digits as its factorization.
13114412211341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1873487458770.
The product of its digits is 2304, while the sum is 29.
Adding to 13114412211341 its reverse (14311221441131), we get a palindrome (27425633652472).
The spelling of 13114412211341 in words is "thirteen trillion, one hundred fourteen billion, four hundred twelve million, two hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •