Base | Representation |
---|---|
bin | 110001110110111000… |
… | …001100111110010001 |
3 | 12010011212202121220121 |
4 | 301312320030332101 |
5 | 1334114204132431 |
6 | 40332044310241 |
7 | 3603423636025 |
oct | 616670147621 |
9 | 163155677817 |
10 | 53534052241 |
11 | 2078163888a |
12 | a460542381 |
13 | 5081c9c8b7 |
14 | 283bc34385 |
15 | 15d4c7b611 |
hex | c76e0cf91 |
53534052241 has 4 divisors (see below), whose sum is σ = 55260957184. Its totient is φ = 51807147300.
The previous prime is 53534052233. The next prime is 53534052251. The reversal of 53534052241 is 14225043535.
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 not a de Polignac number, because 53534052241 - 23 = 53534052233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53534052197 and 53534052206.
It is not an unprimeable number, because it can be changed into a prime (53534052251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 863452425 + ... + 863452486.
It is an arithmetic number, because the mean of its divisors is an integer number (13815239296).
Almost surely, 253534052241 is an apocalyptic number.
It is an amenable number.
53534052241 is a deficient number, since it is larger than the sum of its proper divisors (1726904943).
53534052241 is a wasteful number, since it uses less digits than its factorization.
53534052241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1726904942.
The product of its (nonzero) digits is 72000, while the sum is 34.
Adding to 53534052241 its reverse (14225043535), we get a palindrome (67759095776).
The spelling of 53534052241 in words is "fifty-three billion, five hundred thirty-four million, fifty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •