Base | Representation |
---|---|
bin | 1011110111001101110001… |
… | …1111101010111000110111 |
3 | 1201011220211102120000210202 |
4 | 2331303130133222320313 |
5 | 3202200003310002221 |
6 | 43423550023111115 |
7 | 2514225102502244 |
oct | 275633437527067 |
9 | 51156742500722 |
10 | 13043220000311 |
11 | 4179664721716 |
12 | 1567a43ba249b |
13 | 737c7cb8cab7 |
14 | 33141c1065cb |
15 | 17943dbbcd0b |
hex | bdcdc7eae37 |
13043220000311 has 4 divisors (see below), whose sum is σ = 13264291525800. Its totient is φ = 12822148474824.
The previous prime is 13043220000299. The next prime is 13043220000367. The reversal of 13043220000311 is 11300002234031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13043220000311 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 (13043220500311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110535762656 + ... + 110535762773.
It is an arithmetic number, because the mean of its divisors is an integer number (3316072881450).
Almost surely, 213043220000311 is an apocalyptic number.
13043220000311 is a deficient number, since it is larger than the sum of its proper divisors (221071525489).
13043220000311 is an equidigital number, since it uses as much as digits as its factorization.
13043220000311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221071525488.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13043220000311 its reverse (11300002234031), we get a palindrome (24343222234342).
The spelling of 13043220000311 in words is "thirteen trillion, forty-three billion, two hundred twenty million, three hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •