Base | Representation |
---|---|
bin | 110001110101000010… |
… | …001110001111000101 |
3 | 12010002201120022220210 |
4 | 301311002032033011 |
5 | 1334033244440141 |
6 | 40325021350033 |
7 | 3602600024325 |
oct | 616502161705 |
9 | 163081508823 |
10 | 53503124421 |
11 | 207661342aa |
12 | a452108319 |
13 | 5078761506 |
14 | 2837aa3285 |
15 | 15d21bc916 |
hex | c7508e3c5 |
53503124421 has 8 divisors (see below), whose sum is σ = 75533822784. Its totient is φ = 33570587840.
The previous prime is 53503124417. The next prime is 53503124447. The reversal of 53503124421 is 12442130535.
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 53503124421 - 22 = 53503124417 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53503124021) 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 7 ways as a sum of consecutive naturals, for example, 524540385 + ... + 524540486.
It is an arithmetic number, because the mean of its divisors is an integer number (9441727848).
Almost surely, 253503124421 is an apocalyptic number.
53503124421 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
53503124421 is a deficient number, since it is larger than the sum of its proper divisors (22030698363).
53503124421 is a wasteful number, since it uses less digits than its factorization.
53503124421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049080891.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 53503124421 its reverse (12442130535), we get a palindrome (65945254956).
The spelling of 53503124421 in words is "fifty-three billion, five hundred three million, one hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •