Base | Representation |
---|---|
bin | 101111001011011110111… |
… | …011100101011111101101 |
3 | 102110221112200202100112222 |
4 | 233023132323211133231 |
5 | 411104403222100323 |
6 | 10521230542005125 |
7 | 453144250034231 |
oct | 57133673453755 |
9 | 12427480670488 |
10 | 3242145503213 |
11 | 103aa93683271 |
12 | 444423b767a5 |
13 | 1a696b561b56 |
14 | b2cc64b85c1 |
15 | 59507c049c8 |
hex | 2f2deee57ed |
3242145503213 has 8 divisors (see below), whose sum is σ = 3245110800000. Its totient is φ = 3239180800128.
The previous prime is 3242145503159. The next prime is 3242145503297. The reversal of 3242145503213 is 3123055412423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3242145503213 - 222 = 3242141308909 is a prime.
It is a super-4 number, since 4×32421455032134 (a number of 51 digits) contains 4444 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 (3242145103213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11171420 + ... + 11457962.
It is an arithmetic number, because the mean of its divisors is an integer number (405638850000).
Almost surely, 23242145503213 is an apocalyptic number.
It is an amenable number.
3242145503213 is a deficient number, since it is larger than the sum of its proper divisors (2965296787).
3242145503213 is a wasteful number, since it uses less digits than its factorization.
3242145503213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296851.
The product of its (nonzero) digits is 86400, while the sum is 35.
The spelling of 3242145503213 in words is "three trillion, two hundred forty-two billion, one hundred forty-five million, five hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •