Base | Representation |
---|---|
bin | 1101001001111010… |
… | …0001010010111101 |
3 | 100010002121100210001 |
4 | 3102132201102331 |
5 | 24212442403221 |
6 | 1342222114301 |
7 | 153335561362 |
oct | 32236412275 |
9 | 10102540701 |
10 | 3531216061 |
11 | 155230898a |
12 | 82671b991 |
13 | 443778c79 |
14 | 256da6469 |
15 | 15a026391 |
hex | d27a14bd |
3531216061 has 8 divisors (see below), whose sum is σ = 3637336248. Its totient is φ = 3426048000.
The previous prime is 3531216041. The next prime is 3531216067. The reversal of 3531216061 is 1606121353.
It can be written as a sum of positive squares in 4 ways, for example, as 17690436 + 3513525625 = 4206^2 + 59275^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3531216061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3531216067) 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 7 ways as a sum of consecutive naturals, for example, 230500 + ... + 245341.
It is an arithmetic number, because the mean of its divisors is an integer number (454667031).
Almost surely, 23531216061 is an apocalyptic number.
It is an amenable number.
3531216061 is a deficient number, since it is larger than the sum of its proper divisors (106120187).
3531216061 is a wasteful number, since it uses less digits than its factorization.
3531216061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476063.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 3531216061 is about 59424.0360544452. The cubic root of 3531216061 is about 1522.7949586488.
The spelling of 3531216061 in words is "three billion, five hundred thirty-one million, two hundred sixteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •