Base | Representation |
---|---|
bin | 11000011011101100110111… |
… | …00010010111010111001111 |
3 | 21001020101021110120121221110 |
4 | 30031312123202113113033 |
5 | 24020241132434221420 |
6 | 310134244332303103 |
7 | 14213513506322115 |
oct | 1415663342272717 |
9 | 231211243517843 |
10 | 53728355382735 |
11 | 16135081a11170 |
12 | 6038ab9611a93 |
13 | 23c9740129a97 |
14 | d3a675663ab5 |
15 | 6328e79c0ee0 |
hex | 30dd9b8975cf |
53728355382735 has 64 divisors (see below), whose sum is σ = 95778046715904. Its totient is φ = 25495237248000.
The previous prime is 53728355382731. The next prime is 53728355382763.
53728355382735 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 53728355382735 - 22 = 53728355382731 is a prime.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53728355382731) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 574606507 + ... + 574700003.
It is an arithmetic number, because the mean of its divisors is an integer number (1496531979936).
Almost surely, 253728355382735 is an apocalyptic number.
53728355382735 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
53728355382735 is a deficient number, since it is larger than the sum of its proper divisors (42049691333169).
53728355382735 is a wasteful number, since it uses less digits than its factorization.
53728355382735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167664.
The product of its digits is 635040000, while the sum is 66.
The spelling of 53728355382735 in words is "fifty-three trillion, seven hundred twenty-eight billion, three hundred fifty-five million, three hundred eighty-two thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •