Base | Representation |
---|---|
bin | 1101101011101110… |
… | …0110010011100101 |
3 | 100110222111121021002 |
4 | 3122323212103211 |
5 | 30010300301420 |
6 | 1404250203045 |
7 | 160010315330 |
oct | 33273462345 |
9 | 10428447232 |
10 | 3673056485 |
11 | 161538777a |
12 | 866123485 |
13 | 466c7bc07 |
14 | 26bb69617 |
15 | 1676e3075 |
hex | daee64e5 |
3673056485 has 16 divisors (see below), whose sum is σ = 5039709312. Its totient is φ = 2517480000.
The previous prime is 3673056467. The next prime is 3673056487. The reversal of 3673056485 is 5846503763.
It is not a de Polignac number, because 3673056485 - 28 = 3673056229 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3673056487) 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 15 ways as a sum of consecutive naturals, for example, 54110 + ... + 101360.
It is an arithmetic number, because the mean of its divisors is an integer number (314981832).
Almost surely, 23673056485 is an apocalyptic number.
3673056485 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3673056485 is a deficient number, since it is larger than the sum of its proper divisors (1366652827).
3673056485 is a wasteful number, since it uses less digits than its factorization.
3673056485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49484.
The product of its (nonzero) digits is 1814400, while the sum is 47.
The square root of 3673056485 is about 60605.7463034653. The cubic root of 3673056485 is about 1542.9168988365.
The spelling of 3673056485 in words is "three billion, six hundred seventy-three million, fifty-six thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •