Base | Representation |
---|---|
bin | 1001001111011010… |
… | …00101111110011101 |
3 | 110210202011222100111 |
4 | 10213231011332131 |
5 | 40130020142202 |
6 | 2140141330021 |
7 | 233640436312 |
oct | 44755057635 |
9 | 13722158314 |
10 | 4961099677 |
11 | 2116458686 |
12 | b65566911 |
13 | 610a8b751 |
14 | 350c56d09 |
15 | 1e08206d7 |
hex | 127b45f9d |
4961099677 has 8 divisors (see below), whose sum is σ = 5048811000. Its totient is φ = 4874098944.
The previous prime is 4961099657. The next prime is 4961099707. The reversal of 4961099677 is 7769901694.
It can be written as a sum of positive squares in 4 ways, for example, as 974313796 + 3986785881 = 31214^2 + 63141^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 4961099677 - 227 = 4826881949 is a prime.
It is a super-2 number, since 2×49610996772 = 49225020010259008658, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4961099657) 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, 163552 + ... + 191497.
It is an arithmetic number, because the mean of its divisors is an integer number (631101375).
Almost surely, 24961099677 is an apocalyptic number.
It is an amenable number.
4961099677 is a deficient number, since it is larger than the sum of its proper divisors (87711323).
4961099677 is a wasteful number, since it uses less digits than its factorization.
4961099677 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 355295.
The product of its (nonzero) digits is 5143824, while the sum is 58.
The square root of 4961099677 is about 70435.0741960282. The cubic root of 4961099677 is about 1705.5298218412.
The spelling of 4961099677 in words is "four billion, nine hundred sixty-one million, ninety-nine thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •