Base | Representation |
---|---|
bin | 101101100101010011000… |
… | …010001100010010001001 |
3 | 102002110100000211210100021 |
4 | 231211103002030102021 |
5 | 402310201101223223 |
6 | 10355003230340441 |
7 | 442211251513222 |
oct | 55452302142211 |
9 | 12073300753307 |
10 | 3132424242313 |
11 | aa84a9905a53 |
12 | 42710265a721 |
13 | 199503a2a732 |
14 | ab878332249 |
15 | 5673531b65d |
hex | 2d95308c489 |
3132424242313 has 4 divisors (see below), whose sum is σ = 3132584103940. Its totient is φ = 3132264380688.
The previous prime is 3132424242289. The next prime is 3132424242373.
3132424242313 is nontrivially palindromic in base 10.
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 1127699572624 + 2004724669689 = 1061932^2 + 1415883^2 .
It is a cyclic number.
It is not a de Polignac number, because 3132424242313 - 25 = 3132424242281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3132424242373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79901418 + ... + 79940611.
It is an arithmetic number, because the mean of its divisors is an integer number (783146025985).
Almost surely, 23132424242313 is an apocalyptic number.
It is an amenable number.
3132424242313 is a deficient number, since it is larger than the sum of its proper divisors (159861627).
3132424242313 is a wasteful number, since it uses less digits than its factorization.
3132424242313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159861626.
The product of its digits is 82944, while the sum is 34.
The spelling of 3132424242313 in words is "three trillion, one hundred thirty-two billion, four hundred twenty-four million, two hundred forty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •