Base | Representation |
---|---|
bin | 1001100010011000… |
… | …10001110000100110 |
3 | 111012211200122002120 |
4 | 10301030101300212 |
5 | 40441242104400 |
6 | 2204025050410 |
7 | 240612366660 |
oct | 46114216046 |
9 | 14184618076 |
10 | 5120269350 |
11 | 2198293169 |
12 | baa926a06 |
13 | 637a4b2a1 |
14 | 36804b530 |
15 | 1ee7b1ca0 |
hex | 131311c26 |
5120269350 has 48 divisors (see below), whose sum is σ = 14512309248. Its totient is φ = 1170347040.
The previous prime is 5120269337. The next prime is 5120269351. The reversal of 5120269350 is 539620215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5120269351) 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 23 ways as a sum of consecutive naturals, for example, 2437174 + ... + 2439273.
It is an arithmetic number, because the mean of its divisors is an integer number (302339776).
Almost surely, 25120269350 is an apocalyptic number.
5120269350 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5120269350 is an abundant number, since it is smaller than the sum of its proper divisors (9392039898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5120269350 is a wasteful number, since it uses less digits than its factorization.
5120269350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4876469 (or 4876464 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 33.
The square root of 5120269350 is about 71556.0573955832. The cubic root of 5120269350 is about 1723.5779752968.
Adding to 5120269350 its reverse (539620215), we get a palindrome (5659889565).
The spelling of 5120269350 in words is "five billion, one hundred twenty million, two hundred sixty-nine thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •