Base | Representation |
---|---|
bin | 1001010110100011… |
… | …10010011101011100 |
3 | 110221220222210201100 |
4 | 10223101302131130 |
5 | 40240342110331 |
6 | 2150122313100 |
7 | 235266140553 |
oct | 45321623534 |
9 | 13856883640 |
10 | 5021050716 |
11 | 21472857a0 |
12 | b81658790 |
13 | 62031c336 |
14 | 358bc0d9a |
15 | 1e5c13ae6 |
hex | 12b47275c |
5021050716 has 72 divisors (see below), whose sum is σ = 14021280000. Its totient is φ = 1502261280.
The previous prime is 5021050711. The next prime is 5021050717. The reversal of 5021050716 is 6170501205.
It is a super-2 number, since 2×50210507162 = 50421900585288225312, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5021050716.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5021050711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48966 + ... + 111533.
It is an arithmetic number, because the mean of its divisors is an integer number (194740000).
Almost surely, 25021050716 is an apocalyptic number.
It is an amenable number.
5021050716 is an abundant number, since it is smaller than the sum of its proper divisors (9000229284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5021050716 is a wasteful number, since it uses less digits than its factorization.
5021050716 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160599 (or 160594 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The square root of 5021050716 is about 70859.3728168688. The cubic root of 5021050716 is about 1712.3723346390.
The spelling of 5021050716 in words is "five billion, twenty-one million, fifty thousand, seven hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •