Base | Representation |
---|---|
bin | 110011011000101101011… |
… | …100010100010011101001 |
3 | 110111120201011210111221010 |
4 | 303120231130110103221 |
5 | 430323422212441431 |
6 | 11302120025534133 |
7 | 513060026430144 |
oct | 63305534242351 |
9 | 13446634714833 |
10 | 3531225515241 |
11 | 1141647820a16 |
12 | 490460344349 |
13 | 1c7cbabcbac8 |
14 | c2cab21705b |
15 | 61cc687b846 |
hex | 3362d7144e9 |
3531225515241 has 8 divisors (see below), whose sum is σ = 4708312231840. Its totient is φ = 2354144571072.
The previous prime is 3531225515219. The next prime is 3531225515249. The reversal of 3531225515241 is 1425155221353.
3531225515241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-3531225515241 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3531225515241.
It is not an unprimeable number, because it can be changed into a prime (3531225515249) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 277281 + ... + 2671953.
It is an arithmetic number, because the mean of its divisors is an integer number (588539028980).
Almost surely, 23531225515241 is an apocalyptic number.
It is an amenable number.
3531225515241 is a deficient number, since it is larger than the sum of its proper divisors (1177086716599).
3531225515241 is a wasteful number, since it uses less digits than its factorization.
3531225515241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2886215.
The product of its digits is 180000, while the sum is 39.
The spelling of 3531225515241 in words is "three trillion, five hundred thirty-one billion, two hundred twenty-five million, five hundred fifteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •