Base | Representation |
---|---|
bin | 1001010100110001… |
… | …10011011000000100 |
3 | 110220212212212000012 |
4 | 10222120303120010 |
5 | 40223031043020 |
6 | 2144430205352 |
7 | 235025152322 |
oct | 45230633004 |
9 | 13825785005 |
10 | 5006112260 |
11 | 2139902266 |
12 | b78653858 |
13 | 61a1bba06 |
14 | 356c12d12 |
15 | 1e47627c5 |
hex | 12a633604 |
5006112260 has 12 divisors (see below), whose sum is σ = 10512835788. Its totient is φ = 2002444896.
The previous prime is 5006112253. The next prime is 5006112337. The reversal of 5006112260 is 622116005.
It can be written as a sum of positive squares in 2 ways, for example, as 861070336 + 4145041924 = 29344^2 + 64382^2 .
It is a super-2 number, since 2×50061122602 = 50122319919444615200, which contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 125152787 + ... + 125152826.
It is an arithmetic number, because the mean of its divisors is an integer number (876069649).
Almost surely, 25006112260 is an apocalyptic number.
It is an amenable number.
5006112260 is an abundant number, since it is smaller than the sum of its proper divisors (5506723528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5006112260 is a wasteful number, since it uses less digits than its factorization.
5006112260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250305622 (or 250305620 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 5006112260 is about 70753.8851230093. The cubic root of 5006112260 is about 1710.6724507781.
Adding to 5006112260 its reverse (622116005), we get a palindrome (5628228265).
The spelling of 5006112260 in words is "five billion, six million, one hundred twelve thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •