Base | Representation |
---|---|
bin | 1001001111011011… |
… | …11101011111110000 |
3 | 110210202121112022010 |
4 | 10213231331133300 |
5 | 40130044431323 |
6 | 2140150242520 |
7 | 233642404314 |
oct | 44755753760 |
9 | 13722545263 |
10 | 4961327088 |
11 | 21165a3523 |
12 | b65656440 |
13 | 610b3b103 |
14 | 350cb5b44 |
15 | 1e0867c93 |
hex | 127b7d7f0 |
4961327088 has 20 divisors (see below), whose sum is σ = 12816761768. Its totient is φ = 1653775680.
The previous prime is 4961327029. The next prime is 4961327093. The reversal of 4961327088 is 8807231694.
It is a super-2 number, since 2×49613270882 = 49229532948245119488, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 103360981 = 4961327088 / (4 + 9 + 6 + 1 + 3 + 2 + 7 + 0 + 8 + 8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51680443 + ... + 51680538.
Almost surely, 24961327088 is an apocalyptic number.
4961327088 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4961327088 is an abundant number, since it is smaller than the sum of its proper divisors (7855434680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4961327088 is a wasteful number, since it uses less digits than its factorization.
4961327088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103360992 (or 103360986 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 48.
The square root of 4961327088 is about 70436.6885081915. The cubic root of 4961327088 is about 1705.5558812730. Note that the first 3 decimals are identical.
The spelling of 4961327088 in words is "four billion, nine hundred sixty-one million, three hundred twenty-seven thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •