Base | Representation |
---|---|
bin | 1001010100001011… |
… | …00000101101010100 |
3 | 110220112100220211111 |
4 | 10222011200231110 |
5 | 40220232230220 |
6 | 2144125544404 |
7 | 234634160311 |
oct | 45205405524 |
9 | 13815326744 |
10 | 5001055060 |
11 | 2136a68761 |
12 | b76a15104 |
13 | 61913aba1 |
14 | 356297d08 |
15 | 1e40b415a |
hex | 12a160b54 |
5001055060 has 12 divisors (see below), whose sum is σ = 10502215668. Its totient is φ = 2000422016.
The previous prime is 5001055057. The next prime is 5001055061. The reversal of 5001055060 is 605501005.
It can be written as a sum of positive squares in 2 ways, for example, as 558565956 + 4442489104 = 23634^2 + 66652^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5001055061) 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 3 ways as a sum of consecutive naturals, for example, 125026357 + ... + 125026396.
It is an arithmetic number, because the mean of its divisors is an integer number (875184639).
Almost surely, 25001055060 is an apocalyptic number.
It is an amenable number.
5001055060 is an abundant number, since it is smaller than the sum of its proper divisors (5501160608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001055060 is a wasteful number, since it uses less digits than its factorization.
5001055060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250052762 (or 250052760 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 22.
The square root of 5001055060 is about 70718.1381259433. The cubic root of 5001055060 is about 1710.0962133660.
Adding to 5001055060 its reverse (605501005), we get a palindrome (5606556065).
The spelling of 5001055060 in words is "five billion, one million, fifty-five thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •