Base | Representation |
---|---|
bin | 1001101101001101… |
… | …10010010100010011 |
3 | 111110011121112112112 |
4 | 10312212302110103 |
5 | 41133020321111 |
6 | 2221032015535 |
7 | 243064441403 |
oct | 46646622423 |
9 | 14404545475 |
10 | 5211104531 |
11 | 2234594a66 |
12 | 10152315ab |
13 | 650803409 |
14 | 376134803 |
15 | 207755e8b |
hex | 1369b2513 |
5211104531 has 8 divisors (see below), whose sum is σ = 5452927344. Its totient is φ = 4974596640.
The previous prime is 5211104501. The next prime is 5211104581. The reversal of 5211104531 is 1354011125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5211104531 - 26 = 5211104467 is a prime.
It is a super-2 number, since 2×52111045312 = 54311220866017459922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5211104497 and 5211104506.
It is not an unprimeable number, because it can be changed into a prime (5211104501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1326725 + ... + 1330646.
It is an arithmetic number, because the mean of its divisors is an integer number (681615918).
Almost surely, 25211104531 is an apocalyptic number.
5211104531 is a deficient number, since it is larger than the sum of its proper divisors (241822813).
5211104531 is a wasteful number, since it uses less digits than its factorization.
5211104531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2657461.
The product of its (nonzero) digits is 600, while the sum is 23.
The square root of 5211104531 is about 72187.9805161496. The cubic root of 5211104531 is about 1733.7105619511.
Adding to 5211104531 its reverse (1354011125), we get a palindrome (6565115656).
The spelling of 5211104531 in words is "five billion, two hundred eleven million, one hundred four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •