Base | Representation |
---|---|
bin | 1100000010010110110100… |
… | …1100011000110110010010 |
3 | 1201212012212212002120122211 |
4 | 3000211231030120312102 |
5 | 3213314003301444101 |
6 | 44051523042222334 |
7 | 2534112242412544 |
oct | 300455514306622 |
9 | 51765785076584 |
10 | 13234626203026 |
11 | 4242856513808 |
12 | 1598b616549aa |
13 | 750034932607 |
14 | 33a7b8b0d694 |
15 | 17e3e2951c51 |
hex | c096d318d92 |
13234626203026 has 8 divisors (see below), whose sum is σ = 20536488935820. Its totient is φ = 6389129891088.
The previous prime is 13234626203023. The next prime is 13234626203033. The reversal of 13234626203026 is 62030262643231.
It can be written as a sum of positive squares in 2 ways, for example, as 13064429525625 + 170196677401 = 3614475^2 + 412549^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 13234626203026.
It is not an unprimeable number, because it can be changed into a prime (13234626203021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114091605141 + ... + 114091605256.
Almost surely, 213234626203026 is an apocalyptic number.
13234626203026 is a deficient number, since it is larger than the sum of its proper divisors (7301862732794).
13234626203026 is a wasteful number, since it uses less digits than its factorization.
13234626203026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228183210428.
The product of its (nonzero) digits is 373248, while the sum is 40.
Adding to 13234626203026 its reverse (62030262643231), we get a palindrome (75264888846257).
The spelling of 13234626203026 in words is "thirteen trillion, two hundred thirty-four billion, six hundred twenty-six million, two hundred three thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •