Base | Representation |
---|---|
bin | 1000101000101010… |
… | …01000101010110001 |
3 | 102222002112211222000 |
4 | 10110111020222301 |
5 | 33443312132040 |
6 | 2044010404213 |
7 | 222612536004 |
oct | 42425105261 |
9 | 12862484860 |
10 | 4636052145 |
11 | 1a69a2665a |
12 | a94730669 |
13 | 58b630c2a |
14 | 31da0353b |
15 | 1c2015130 |
hex | 114548ab1 |
4636052145 has 64 divisors (see below), whose sum is σ = 8464435200. Its totient is φ = 2406628800.
The previous prime is 4636052137. The next prime is 4636052153. The reversal of 4636052145 is 5412506364.
4636052145 is a `hidden beast` number, since 4 + 6 + 3 + 605 + 2 + 1 + 45 = 666.
It is an interprime number because it is at equal distance from previous prime (4636052137) and next prime (4636052153).
It is not a de Polignac number, because 4636052145 - 23 = 4636052137 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 817570 + ... + 823220.
It is an arithmetic number, because the mean of its divisors is an integer number (132256800).
Almost surely, 24636052145 is an apocalyptic number.
4636052145 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4636052145 is a deficient number, since it is larger than the sum of its proper divisors (3828383055).
4636052145 is a wasteful number, since it uses less digits than its factorization.
4636052145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5827 (or 5821 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The square root of 4636052145 is about 68088.5610436878. The cubic root of 4636052145 is about 1667.4370123967.
The spelling of 4636052145 in words is "four billion, six hundred thirty-six million, fifty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •