Base | Representation |
---|---|
bin | 101111000001011111101… |
… | …001001100111111101001 |
3 | 102102220212012220112102202 |
4 | 233001133221030333221 |
5 | 410420422012340431 |
6 | 10512254402105545 |
7 | 452314413111515 |
oct | 57013751147751 |
9 | 12386765815382 |
10 | 3231420043241 |
11 | 103648a40a465 |
12 | 44233004b2b5 |
13 | 1a594c48c930 |
14 | b2589c71145 |
15 | 590cb2e58cb |
hex | 2f05fa4cfe9 |
3231420043241 has 4 divisors (see below), whose sum is σ = 3479990815812. Its totient is φ = 2982849270672.
The previous prime is 3231420043169. The next prime is 3231420043253. The reversal of 3231420043241 is 1423400241323.
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 312861235600 + 2918558807641 = 559340^2 + 1708379^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3231420043241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3231420003241) 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, 124285386266 + ... + 124285386291.
It is an arithmetic number, because the mean of its divisors is an integer number (869997703953).
Almost surely, 23231420043241 is an apocalyptic number.
It is an amenable number.
3231420043241 is a deficient number, since it is larger than the sum of its proper divisors (248570772571).
3231420043241 is a wasteful number, since it uses less digits than its factorization.
3231420043241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248570772570.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 3231420043241 its reverse (1423400241323), we get a palindrome (4654820284564).
The spelling of 3231420043241 in words is "three trillion, two hundred thirty-one billion, four hundred twenty million, forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •