Base | Representation |
---|---|
bin | 1100000000010110101101… |
… | …0110011001100000000111 |
3 | 1201201221010002222121011002 |
4 | 3000011223112121200013 |
5 | 3212233040244044333 |
6 | 44024034323003515 |
7 | 2531454066511424 |
oct | 300055326314007 |
9 | 51657102877132 |
10 | 13200235534343 |
11 | 422a208914380 |
12 | 159236420959b |
13 | 749a13a23910 |
14 | 338c754d8d4b |
15 | 17d57d6340e8 |
hex | c016b599807 |
13200235534343 has 32 divisors (see below), whose sum is σ = 16059321653760. Its totient is φ = 10684087666560.
The previous prime is 13200235534333. The next prime is 13200235534379. The reversal of 13200235534343 is 34343553200231.
It is not a de Polignac number, because 13200235534343 - 212 = 13200235530247 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13200235534297 and 13200235534306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13200235534333) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2364296 + ... + 5656002.
It is an arithmetic number, because the mean of its divisors is an integer number (501853801680).
Almost surely, 213200235534343 is an apocalyptic number.
13200235534343 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13200235534343 is a deficient number, since it is larger than the sum of its proper divisors (2859086119417).
13200235534343 is a wasteful number, since it uses less digits than its factorization.
13200235534343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3292727.
The product of its (nonzero) digits is 388800, while the sum is 38.
Adding to 13200235534343 its reverse (34343553200231), we get a palindrome (47543788734574).
The spelling of 13200235534343 in words is "thirteen trillion, two hundred billion, two hundred thirty-five million, five hundred thirty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •