Base | Representation |
---|---|
bin | 110001100101011011… |
… | …001101111101011001 |
3 | 12002102110210021222212 |
4 | 301211123031331121 |
5 | 1333014224211213 |
6 | 40243024324505 |
7 | 3563240041142 |
oct | 614533157531 |
9 | 162373707885 |
10 | 53241241433 |
11 | 20641324786 |
12 | a39a473735 |
13 | 503641b173 |
14 | 2810db2ac9 |
15 | 15b91dc9a8 |
hex | c656cdf59 |
53241241433 has 4 divisors (see below), whose sum is σ = 55077146340. Its totient is φ = 51405336528.
The previous prime is 53241241421. The next prime is 53241241439. The reversal of 53241241433 is 33414214235.
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 21943385689 + 31297855744 = 148133^2 + 176912^2 .
It is a cyclic number.
It is not a de Polignac number, because 53241241433 - 212 = 53241237337 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 53241241433.
It is not an unprimeable number, because it can be changed into a prime (53241241439) 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, 917952410 + ... + 917952467.
It is an arithmetic number, because the mean of its divisors is an integer number (13769286585).
Almost surely, 253241241433 is an apocalyptic number.
It is an amenable number.
53241241433 is a deficient number, since it is larger than the sum of its proper divisors (1835904907).
53241241433 is a wasteful number, since it uses less digits than its factorization.
53241241433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1835904906.
The product of its digits is 34560, while the sum is 32.
Adding to 53241241433 its reverse (33414214235), we get a palindrome (86655455668).
The spelling of 53241241433 in words is "fifty-three billion, two hundred forty-one million, two hundred forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •