Base | Representation |
---|---|
bin | 11111110001110… |
… | …001001100011101 |
3 | 1101011012022221022 |
4 | 133301301030131 |
5 | 2042440442003 |
6 | 124523013525 |
7 | 16132421522 |
oct | 3761611435 |
9 | 1334168838 |
10 | 533140253 |
11 | 253a42188 |
12 | 12a66a2a5 |
13 | 865b9509 |
14 | 50b41149 |
15 | 31c12738 |
hex | 1fc7131d |
533140253 has 4 divisors (see below), whose sum is σ = 556320288. Its totient is φ = 509960220.
The previous prime is 533140249. The next prime is 533140301. The reversal of 533140253 is 352041335.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 533140253 - 22 = 533140249 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (533143253) 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 3 ways as a sum of consecutive naturals, for example, 11589983 + ... + 11590028.
It is an arithmetic number, because the mean of its divisors is an integer number (139080072).
Almost surely, 2533140253 is an apocalyptic number.
It is an amenable number.
533140253 is a deficient number, since it is larger than the sum of its proper divisors (23180035).
533140253 is a wasteful number, since it uses less digits than its factorization.
533140253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23180034.
The product of its (nonzero) digits is 5400, while the sum is 26.
The square root of 533140253 is about 23089.8300773306. The cubic root of 533140253 is about 810.8623914654.
Adding to 533140253 its reverse (352041335), we get a palindrome (885181588).
The spelling of 533140253 in words is "five hundred thirty-three million, one hundred forty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •