Base | Representation |
---|---|
bin | 1001010011100001… |
… | …10011100000110101 |
3 | 110220011011011000111 |
4 | 10221300303200311 |
5 | 40212340031221 |
6 | 2143413343021 |
7 | 234540062245 |
oct | 45160634065 |
9 | 13804134014 |
10 | 4995627061 |
11 | 21339a0607 |
12 | b75037a71 |
13 | 617c8a359 |
14 | 355683b25 |
15 | 1e3890be1 |
hex | 129c33835 |
4995627061 has 8 divisors (see below), whose sum is σ = 5050043064. Its totient is φ = 4941504960.
The previous prime is 4995627053. The next prime is 4995627067. The reversal of 4995627061 is 1607265994.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3057426436 + 1938200625 = 55294^2 + 44025^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 4995627061 - 23 = 4995627053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4995626996 and 4995627014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4995627067) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39210 + ... + 107371.
It is an arithmetic number, because the mean of its divisors is an integer number (631255383).
Almost surely, 24995627061 is an apocalyptic number.
It is an amenable number.
4995627061 is a deficient number, since it is larger than the sum of its proper divisors (54416003).
4995627061 is a wasteful number, since it uses less digits than its factorization.
4995627061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146951.
The product of its (nonzero) digits is 816480, while the sum is 49.
The square root of 4995627061 is about 70679.7500066320. The cubic root of 4995627061 is about 1709.4772932426.
The spelling of 4995627061 in words is "four billion, nine hundred ninety-five million, six hundred twenty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •