Base | Representation |
---|---|
bin | 1001101101011000… |
… | …01111001100000111 |
3 | 111110021022010201201 |
4 | 10312230033030013 |
5 | 41133402033021 |
6 | 2221122403331 |
7 | 243112542463 |
oct | 46654171407 |
9 | 14407263651 |
10 | 5212533511 |
11 | 2235380639 |
12 | 1015800547 |
13 | 650bb3973 |
14 | 3763c74a3 |
15 | 207939591 |
hex | 136b0f307 |
5212533511 has 12 divisors (see below), whose sum is σ = 5521720224. Its totient is φ = 4919875200.
The previous prime is 5212533427. The next prime is 5212533559. The reversal of 5212533511 is 1153352125.
It is not a de Polignac number, because 5212533511 - 215 = 5212500743 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5212533511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5212533211) 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 11 ways as a sum of consecutive naturals, for example, 71191 + ... + 124471.
It is an arithmetic number, because the mean of its divisors is an integer number (460143352).
Almost surely, 25212533511 is an apocalyptic number.
5212533511 is a deficient number, since it is larger than the sum of its proper divisors (309186713).
5212533511 is a wasteful number, since it uses less digits than its factorization.
5212533511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53590 (or 53571 counting only the distinct ones).
The product of its digits is 4500, while the sum is 28.
The square root of 5212533511 is about 72197.8774688010. The cubic root of 5212533511 is about 1733.8690191640.
Adding to 5212533511 its reverse (1153352125), we get a palindrome (6365885636).
The spelling of 5212533511 in words is "five billion, two hundred twelve million, five hundred thirty-three thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •