Base | Representation |
---|---|
bin | 1000110111000001… |
… | …11111010101010001 |
3 | 110021111101022201202 |
4 | 10123200333111101 |
5 | 34220142201040 |
6 | 2103554240545 |
7 | 225605301623 |
oct | 43340772521 |
9 | 13244338652 |
10 | 4756600145 |
11 | 2020a82100 |
12 | b08b86155 |
13 | 5aa5ba3cb |
14 | 331a22c13 |
15 | 1cc8c8015 |
hex | 11b83f551 |
4756600145 has 12 divisors (see below), whose sum is σ = 6273995700. Its totient is φ = 3459345120.
The previous prime is 4756600141. The next prime is 4756600171. The reversal of 4756600145 is 5410066574.
It can be written as a sum of positive squares in 2 ways, for example, as 2848570384 + 1908029761 = 53372^2 + 43681^2 .
It is not a de Polignac number, because 4756600145 - 22 = 4756600141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4756600099 and 4756600108.
It is not an unprimeable number, because it can be changed into a prime (4756600141) 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 11 ways as a sum of consecutive naturals, for example, 3930470 + ... + 3931679.
It is an arithmetic number, because the mean of its divisors is an integer number (522832975).
Almost surely, 24756600145 is an apocalyptic number.
It is an amenable number.
4756600145 is a deficient number, since it is larger than the sum of its proper divisors (1517395555).
4756600145 is a wasteful number, since it uses less digits than its factorization.
4756600145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7862176 (or 7862165 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 38.
The square root of 4756600145 is about 68968.1096232164. The cubic root of 4756600145 is about 1681.7659228949.
The spelling of 4756600145 in words is "four billion, seven hundred fifty-six million, six hundred thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •