Base | Representation |
---|---|
bin | 1011110110000111011101… |
… | …0011011010101011110011 |
3 | 1201010010002211001121012102 |
4 | 2331201313103122223303 |
5 | 3201342323124421321 |
6 | 43411144511051015 |
7 | 2512656226636463 |
oct | 275416723325363 |
9 | 51103084047172 |
10 | 13024342420211 |
11 | 4171657830351 |
12 | 1564255b10a6b |
13 | 736261bb5865 |
14 | 33054ad17ba3 |
15 | 178bd6765c0b |
hex | bd8774daaf3 |
13024342420211 has 8 divisors (see below), whose sum is σ = 13044899327040. Its totient is φ = 13003796521408.
The previous prime is 13024342420169. The next prime is 13024342420253. The reversal of 13024342420211 is 11202424342031.
It is an interprime number because it is at equal distance from previous prime (13024342420169) and next prime (13024342420253).
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 13024342420211 - 26 = 13024342420147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13024342420711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 382196 + ... + 5118081.
It is an arithmetic number, because the mean of its divisors is an integer number (1630612415880).
Almost surely, 213024342420211 is an apocalyptic number.
13024342420211 is a deficient number, since it is larger than the sum of its proper divisors (20556906829).
13024342420211 is an equidigital number, since it uses as much as digits as its factorization.
13024342420211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5504013.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 13024342420211 its reverse (11202424342031), we get a palindrome (24226766762242).
The spelling of 13024342420211 in words is "thirteen trillion, twenty-four billion, three hundred forty-two million, four hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •