Base | Representation |
---|---|
bin | 1100011001001011000111… |
… | …1110001111001010110011 |
3 | 1210020200200201121200110121 |
4 | 3012102301332033022303 |
5 | 3241224310232121303 |
6 | 44551552255511111 |
7 | 2604330254063164 |
oct | 306226176171263 |
9 | 53220621550417 |
10 | 13626622145203 |
11 | 4384021a56a91 |
12 | 1640b20228497 |
13 | 77aca5c39862 |
14 | 351763c6d76b |
15 | 1896d67ec9bd |
hex | c64b1f8f2b3 |
13626622145203 has 4 divisors (see below), whose sum is σ = 13916550276000. Its totient is φ = 13336694014408.
The previous prime is 13626622145173. The next prime is 13626622145209. The reversal of 13626622145203 is 30254122662631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13626622145203 - 29 = 13626622144691 is a prime.
It is a super-2 number, since 2×136266221452032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13626622145203.
It is not an unprimeable number, because it can be changed into a prime (13626622145209) 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, 144964065328 + ... + 144964065421.
It is an arithmetic number, because the mean of its divisors is an integer number (3479137569000).
Almost surely, 213626622145203 is an apocalyptic number.
13626622145203 is a deficient number, since it is larger than the sum of its proper divisors (289928130797).
13626622145203 is an equidigital number, since it uses as much as digits as its factorization.
13626622145203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289928130796.
The product of its (nonzero) digits is 622080, while the sum is 43.
The spelling of 13626622145203 in words is "thirteen trillion, six hundred twenty-six billion, six hundred twenty-two million, one hundred forty-five thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •