Base | Representation |
---|---|
bin | 1001001100101000… |
… | …00111110000000101 |
3 | 110202010022000110112 |
4 | 10212110013300011 |
5 | 40103032314013 |
6 | 2133545402405 |
7 | 233235255533 |
oct | 44624076005 |
9 | 13663260415 |
10 | 4937776133 |
11 | 2104278324 |
12 | b59799405 |
13 | 608cb3634 |
14 | 34bb05153 |
15 | 1dd764ba8 |
hex | 126507c05 |
4937776133 has 8 divisors (see below), whose sum is σ = 5072614680. Its totient is φ = 4803010560.
The previous prime is 4937776093. The next prime is 4937776163. The reversal of 4937776133 is 3316777394.
It can be written as a sum of positive squares in 4 ways, for example, as 1475865889 + 3461910244 = 38417^2 + 58838^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4937776133 - 228 = 4669340677 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 (4937776163) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 136613 + ... + 168933.
It is an arithmetic number, because the mean of its divisors is an integer number (634076835).
Almost surely, 24937776133 is an apocalyptic number.
It is an amenable number.
4937776133 is a deficient number, since it is larger than the sum of its proper divisors (134838547).
4937776133 is a wasteful number, since it uses less digits than its factorization.
4937776133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36487.
The product of its digits is 2000376, while the sum is 50.
The square root of 4937776133 is about 70269.3114595554. The cubic root of 4937776133 is about 1702.8528951356.
The spelling of 4937776133 in words is "four billion, nine hundred thirty-seven million, seven hundred seventy-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •