Base | Representation |
---|---|
bin | 110001110101000011… |
… | …000001011010011011 |
3 | 12010002201221222110120 |
4 | 301311003001122123 |
5 | 1334033323142133 |
6 | 40325030044323 |
7 | 3602601556425 |
oct | 616503013233 |
9 | 163081858416 |
10 | 53503334043 |
11 | 20766267845 |
12 | a4521a96a3 |
13 | 5078805a53 |
14 | 2837b19815 |
15 | 15d220eab3 |
hex | c750c169b |
53503334043 has 8 divisors (see below), whose sum is σ = 71353976400. Its totient is φ = 35660790528.
The previous prime is 53503334033. The next prime is 53503334051. The reversal of 53503334043 is 34043330535.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53503334043 - 29 = 53503333531 is a prime.
It is a super-3 number, since 3×535033340433 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53503333995 and 53503334013.
It is not an unprimeable number, because it can be changed into a prime (53503334033) 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, 2009278 + ... + 2035731.
It is an arithmetic number, because the mean of its divisors is an integer number (8919247050).
Almost surely, 253503334043 is an apocalyptic number.
53503334043 is a deficient number, since it is larger than the sum of its proper divisors (17850642357).
53503334043 is a wasteful number, since it uses less digits than its factorization.
53503334043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4049421.
The product of its (nonzero) digits is 97200, while the sum is 33.
Adding to 53503334043 its reverse (34043330535), we get a palindrome (87546664578).
The spelling of 53503334043 in words is "fifty-three billion, five hundred three million, three hundred thirty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •