Base | Representation |
---|---|
bin | 1001010110010101… |
… | …01001000101100000 |
3 | 110221210110121220000 |
4 | 10223022221011200 |
5 | 40234402133222 |
6 | 2150014220000 |
7 | 235244206002 |
oct | 45312510540 |
9 | 13853417800 |
10 | 5019177312 |
11 | 2146216226 |
12 | b80ab4600 |
13 | 61cb14706 |
14 | 358854372 |
15 | 1e59939ac |
hex | 12b2a9160 |
5019177312 has 120 divisors (see below), whose sum is σ = 14914186056. Its totient is φ = 1655728128.
The previous prime is 5019177311. The next prime is 5019177343. The reversal of 5019177312 is 2137719105.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5019177311) 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 19 ways as a sum of consecutive naturals, for example, 241443 + ... + 261405.
Almost surely, 25019177312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5019177312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7457093028).
5019177312 is an abundant number, since it is smaller than the sum of its proper divisors (9895008744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5019177312 is a wasteful number, since it uses less digits than its factorization.
5019177312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20082 (or 20065 counting only the distinct ones).
The product of its (nonzero) digits is 13230, while the sum is 36.
The square root of 5019177312 is about 70846.1524149336. The cubic root of 5019177312 is about 1712.1593404259.
The spelling of 5019177312 in words is "five billion, nineteen million, one hundred seventy-seven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •