Base | Representation |
---|---|
bin | 1001110011001011… |
… | …00111101100000101 |
3 | 111120122202010021020 |
4 | 10321211213230011 |
5 | 41233322134001 |
6 | 2230020141353 |
7 | 244242604614 |
oct | 47145475405 |
9 | 14518663236 |
10 | 5261130501 |
11 | 225a853240 |
12 | 1029b37859 |
13 | 65ac9a593 |
14 | 37ca3787b |
15 | 20bd38736 |
hex | 139967b05 |
5261130501 has 64 divisors (see below), whose sum is σ = 7959133440. Its totient is φ = 3064320000.
The previous prime is 5261130493. The next prime is 5261130503. The reversal of 5261130501 is 1050311625.
5261130501 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5261130501 - 23 = 5261130493 is a prime.
It is a super-2 number, since 2×52611305012 = 55358988297105022002, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5261130503) 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 63 ways as a sum of consecutive naturals, for example, 22974255 + ... + 22974483.
It is an arithmetic number, because the mean of its divisors is an integer number (124361460).
Almost surely, 25261130501 is an apocalyptic number.
It is an amenable number.
5261130501 is a deficient number, since it is larger than the sum of its proper divisors (2698002939).
5261130501 is a wasteful number, since it uses less digits than its factorization.
5261130501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518.
The product of its (nonzero) digits is 900, while the sum is 24.
The square root of 5261130501 is about 72533.6508180858. The cubic root of 5261130501 is about 1739.2407068273.
The spelling of 5261130501 in words is "five billion, two hundred sixty-one million, one hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •