Base | Representation |
---|---|
bin | 101111001011011101101… |
… | …110010000010101010101 |
3 | 102110221111021121102220202 |
4 | 233023131232100111111 |
5 | 411104333024401240 |
6 | 10521224535310245 |
7 | 453143612523662 |
oct | 57133556202525 |
9 | 12427437542822 |
10 | 3242125231445 |
11 | 103aa83197841 |
12 | 44441921b385 |
13 | 1a69672b4b19 |
14 | b2cc391ca69 |
15 | 5950604d315 |
hex | 2f2ddb90555 |
3242125231445 has 8 divisors (see below), whose sum is σ = 3890777911200. Its totient is φ = 2593548429520.
The previous prime is 3242125231427. The next prime is 3242125231483. The reversal of 3242125231445 is 5441325212423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-3242125231445 is a prime.
It is a super-2 number, since 2×32421252314452 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3242125231399 and 3242125231408.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18875411 + ... + 19046400.
It is an arithmetic number, because the mean of its divisors is an integer number (486347238900).
Almost surely, 23242125231445 is an apocalyptic number.
It is an amenable number.
3242125231445 is a deficient number, since it is larger than the sum of its proper divisors (648652679755).
3242125231445 is a wasteful number, since it uses less digits than its factorization.
3242125231445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37938915.
The product of its digits is 230400, while the sum is 38.
The spelling of 3242125231445 in words is "three trillion, two hundred forty-two billion, one hundred twenty-five million, two hundred thirty-one thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •