Base | Representation |
---|---|
bin | 11000000110100101110101… |
… | …00000100011110011000010 |
3 | 20221200001001222111101120111 |
4 | 30003102322200203303002 |
5 | 23421400144013430200 |
6 | 304421130452301534 |
7 | 14110225245311431 |
oct | 1403227240436302 |
9 | 227601058441514 |
10 | 53003025530050 |
11 | 15985503142322 |
12 | 5b404120118aa |
13 | 237621900593b |
14 | d13508271118 |
15 | 61dae4cdc0ba |
hex | 3034ba823cc2 |
53003025530050 has 12 divisors (see below), whose sum is σ = 98585627485986. Its totient is φ = 21201210212000.
The previous prime is 53003025530023. The next prime is 53003025530087. The reversal of 53003025530050 is 5003552030035.
It can be written as a sum of positive squares in 3 ways, for example, as 49631898190081 + 3371127339969 = 7044991^2 + 1836063^2 .
It is a junction number, because it is equal to n+sod(n) for n = 53003025529994 and 53003025530021.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 530030255251 + ... + 530030255350.
Almost surely, 253003025530050 is an apocalyptic number.
53003025530050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53003025530050 is a deficient number, since it is larger than the sum of its proper divisors (45582601955936).
53003025530050 is a wasteful number, since it uses less digits than its factorization.
53003025530050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1060060510613 (or 1060060510608 counting only the distinct ones).
The product of its (nonzero) digits is 33750, while the sum is 31.
Adding to 53003025530050 its reverse (5003552030035), we get a palindrome (58006577560085).
The spelling of 53003025530050 in words is "fifty-three trillion, three billion, twenty-five million, five hundred thirty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •