Base | Representation |
---|---|
bin | 1101101101101111… |
… | …0100101010001101 |
3 | 100111120101202220202 |
4 | 3123123310222031 |
5 | 30014431111020 |
6 | 1405151223245 |
7 | 160142160323 |
oct | 33333645215 |
9 | 10446352822 |
10 | 3681503885 |
11 | 161a1273a4 |
12 | 868b17b25 |
13 | 468948b87 |
14 | 26cd27d13 |
15 | 168310e75 |
hex | db6f4a8d |
3681503885 has 32 divisors (see below), whose sum is σ = 4638796800. Its totient is φ = 2802159360.
The previous prime is 3681503879. The next prime is 3681503887. The reversal of 3681503885 is 5883051863.
3681503885 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3681503885 - 210 = 3681502861 is a prime.
It is a super-3 number, since 3×36815038853 (a number of 30 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3681503887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1591880 + ... + 1594190.
It is an arithmetic number, because the mean of its divisors is an integer number (144962400).
Almost surely, 23681503885 is an apocalyptic number.
It is an amenable number.
3681503885 is a deficient number, since it is larger than the sum of its proper divisors (957292915).
3681503885 is a wasteful number, since it uses less digits than its factorization.
3681503885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2541.
The product of its (nonzero) digits is 691200, while the sum is 47.
The square root of 3681503885 is about 60675.3976913213. The cubic root of 3681503885 is about 1544.0988079905.
The spelling of 3681503885 in words is "three billion, six hundred eighty-one million, five hundred three thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •