Base | Representation |
---|---|
bin | 101110111011111011010… |
… | …110010110001001011111 |
3 | 102102100102121221100200212 |
4 | 232323323112112021133 |
5 | 410321201224123403 |
6 | 10505425304443035 |
7 | 452013320063543 |
oct | 56737326261137 |
9 | 12370377840625 |
10 | 3225442411103 |
11 | 10339a2176a10 |
12 | 44114217947b |
13 | 1a5208c25cb3 |
14 | b2180005a23 |
15 | 58d7b62a4d8 |
hex | 2eefb59625f |
3225442411103 has 128 divisors (see below), whose sum is σ = 3876689617920. Its totient is φ = 2655201669120.
The previous prime is 3225442411057. The next prime is 3225442411127. The reversal of 3225442411103 is 3011142445223.
3225442411103 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3225442411103 - 218 = 3225442148959 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3225442411103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3225442411903) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10304927675 + ... + 10304927987.
It is an arithmetic number, because the mean of its divisors is an integer number (30286637640).
Almost surely, 23225442411103 is an apocalyptic number.
3225442411103 is a deficient number, since it is larger than the sum of its proper divisors (651247206817).
3225442411103 is a wasteful number, since it uses less digits than its factorization.
3225442411103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 3225442411103 its reverse (3011142445223), we get a palindrome (6236584856326).
The spelling of 3225442411103 in words is "three trillion, two hundred twenty-five billion, four hundred forty-two million, four hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •