Base | Representation |
---|---|
bin | 101110111101000001111… |
… | …001100000100101011101 |
3 | 102102110111010010122002102 |
4 | 232331001321200211131 |
5 | 410331112231042023 |
6 | 10510142545534445 |
7 | 452054541522314 |
oct | 56750171404535 |
9 | 12373433118072 |
10 | 3226626034013 |
11 | 103444a307368 |
12 | 441412644425 |
13 | 1a5367205095 |
14 | b22532b127b |
15 | 58dea4cd628 |
hex | 2ef41e6095d |
3226626034013 has 4 divisors (see below), whose sum is σ = 3226650906780. Its totient is φ = 3226601161248.
The previous prime is 3226626034007. The next prime is 3226626034057. The reversal of 3226626034013 is 3104306266223.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2964863846884 + 261762187129 = 1721878^2 + 511627^2 .
It is a cyclic number.
It is not a de Polignac number, because 3226626034013 - 218 = 3226625771869 is a prime.
It is a super-2 number, since 2×32266260340132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3226626034913) 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, 12240770 + ... + 12501587.
It is an arithmetic number, because the mean of its divisors is an integer number (806662726695).
Almost surely, 23226626034013 is an apocalyptic number.
It is an amenable number.
3226626034013 is a deficient number, since it is larger than the sum of its proper divisors (24872767).
3226626034013 is a wasteful number, since it uses less digits than its factorization.
3226626034013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24872766.
The product of its (nonzero) digits is 186624, while the sum is 38.
The spelling of 3226626034013 in words is "three trillion, two hundred twenty-six billion, six hundred twenty-six million, thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •