Base | Representation |
---|---|
bin | 11000001101110001111010… |
… | …00010010110001010111011 |
3 | 20222112122122001021110011010 |
4 | 30012320331002112022323 |
5 | 23434422024302423313 |
6 | 305130420404405003 |
7 | 14134121230401354 |
oct | 1406707502261273 |
9 | 228478561243133 |
10 | 53250028561083 |
11 | 15a70234996412 |
12 | 5b802669a6763 |
13 | 23935c1201ac3 |
14 | d2145aa28d2b |
15 | 62524e9604c3 |
hex | 306e3d0962bb |
53250028561083 has 8 divisors (see below), whose sum is σ = 71005930738000. Its totient is φ = 35497072712448.
The previous prime is 53250028560947. The next prime is 53250028561091. The reversal of 53250028561083 is 38016582005235.
53250028561083 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53250028561083 - 213 = 53250028552891 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53250028561283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 736539898 + ... + 736612191.
It is an arithmetic number, because the mean of its divisors is an integer number (8875741342250).
Almost surely, 253250028561083 is an apocalyptic number.
53250028561083 is a deficient number, since it is larger than the sum of its proper divisors (17755902176917).
53250028561083 is a wasteful number, since it uses less digits than its factorization.
53250028561083 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1473164141.
The product of its (nonzero) digits is 1728000, while the sum is 48.
The spelling of 53250028561083 in words is "fifty-three trillion, two hundred fifty billion, twenty-eight million, five hundred sixty-one thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •