Base | Representation |
---|---|
bin | 11000011001110001101001… |
… | …00010000110010001001110 |
3 | 21001000001112011201200210212 |
4 | 30030320310202012101032 |
5 | 24013200142401000110 |
6 | 310044024200002422 |
7 | 14205652260242540 |
oct | 1414706442062116 |
9 | 231001464650725 |
10 | 53662202750030 |
11 | 1610a015533096 |
12 | 6028117160412 |
13 | 23c3429ac2834 |
14 | d3739b9cd690 |
15 | 630d25035e05 |
hex | 30ce3488644e |
53662202750030 has 64 divisors (see below), whose sum is σ = 114379996423680. Its totient is φ = 17745373785984.
The previous prime is 53662202750011. The next prime is 53662202750033. The reversal of 53662202750030 is 3005720226635.
It is a self number, because there is not a number n which added to its sum of digits gives 53662202750030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53662202750033) 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 31 ways as a sum of consecutive naturals, for example, 122359124 + ... + 122796903.
It is an arithmetic number, because the mean of its divisors is an integer number (1787187444120).
Almost surely, 253662202750030 is an apocalyptic number.
53662202750030 is an abundant number, since it is smaller than the sum of its proper divisors (60717793673650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53662202750030 is a wasteful number, since it uses less digits than its factorization.
53662202750030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245156153.
The product of its (nonzero) digits is 453600, while the sum is 41.
Adding to 53662202750030 its reverse (3005720226635), we get a palindrome (56667922976665).
The spelling of 53662202750030 in words is "fifty-three trillion, six hundred sixty-two billion, two hundred two million, seven hundred fifty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •