Base | Representation |
---|---|
bin | 1001101101001110… |
… | …10001000000110101 |
3 | 111110011211221000012 |
4 | 10312213101000311 |
5 | 41133033332021 |
6 | 2221034430005 |
7 | 243065504066 |
oct | 46647210065 |
9 | 14404757005 |
10 | 5211230261 |
11 | 2234670476 |
12 | 1015292305 |
13 | 650848703 |
14 | 37616856d |
15 | 20777d35b |
hex | 1369d1035 |
5211230261 has 4 divisors (see below), whose sum is σ = 5269783500. Its totient is φ = 5152677024.
The previous prime is 5211230237. The next prime is 5211230273. The reversal of 5211230261 is 1620321125.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 763140625 + 4448089636 = 27625^2 + 66694^2 .
It is a cyclic number.
It is not a de Polignac number, because 5211230261 - 226 = 5144121397 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5211230161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29276486 + ... + 29276663.
It is an arithmetic number, because the mean of its divisors is an integer number (1317445875).
Almost surely, 25211230261 is an apocalyptic number.
It is an amenable number.
5211230261 is a deficient number, since it is larger than the sum of its proper divisors (58553239).
5211230261 is an equidigital number, since it uses as much as digits as its factorization.
5211230261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58553238.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 5211230261 is about 72188.8513622429. The cubic root of 5211230261 is about 1733.7245051037.
Adding to 5211230261 its reverse (1620321125), we get a palindrome (6831551386).
The spelling of 5211230261 in words is "five billion, two hundred eleven million, two hundred thirty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •