Base | Representation |
---|---|
bin | 1001100101011010… |
… | …00110010100000100 |
3 | 111021121110010101210 |
4 | 10302231012110010 |
5 | 41014241303221 |
6 | 2210333051420 |
7 | 241341210213 |
oct | 46255062404 |
9 | 14247403353 |
10 | 5145650436 |
11 | 2200649373 |
12 | bb7326b70 |
13 | 640096a94 |
14 | 36b57707a |
15 | 201b27276 |
hex | 132b46504 |
5145650436 has 48 divisors (see below), whose sum is σ = 12549196800. Its totient is φ = 1637937312.
The previous prime is 5145650407. The next prime is 5145650443. The reversal of 5145650436 is 6340565415.
It is a junction number, because it is equal to n+sod(n) for n = 5145650394 and 5145650403.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 155785 + ... + 185903.
It is an arithmetic number, because the mean of its divisors is an integer number (261441600).
Almost surely, 25145650436 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 5145650436, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6274598400).
5145650436 is an abundant number, since it is smaller than the sum of its proper divisors (7403546364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5145650436 is a wasteful number, since it uses less digits than its factorization.
5145650436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30768 (or 30766 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
The square root of 5145650436 is about 71733.1892222840. The cubic root of 5145650436 is about 1726.4211978601.
The spelling of 5145650436 in words is "five billion, one hundred forty-five million, six hundred fifty thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •