Base | Representation |
---|---|
bin | 11000001101010010110100… |
… | …01011001100100110101001 |
3 | 20222111001112211012022002121 |
4 | 30012221122023030212221 |
5 | 23434133333403120043 |
6 | 305115020242231241 |
7 | 14132660505222235 |
oct | 1406513213144651 |
9 | 228431484168077 |
10 | 53233337551273 |
11 | 15a6414a291730 |
12 | 5b78b89055521 |
13 | 2391b61236539 |
14 | d20715dbd5c5 |
15 | 624ac4470ded |
hex | 306a5a2cc9a9 |
53233337551273 has 8 divisors (see below), whose sum is σ = 58529997480960. Its totient is φ = 48012888556080.
The previous prime is 53233337551249. The next prime is 53233337551283. The reversal of 53233337551273 is 37215573333235.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53233337551273 - 217 = 53233337420201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53233337551273.
It is not an unprimeable number, because it can be changed into a prime (53233337551213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19052732158 + ... + 19052734951.
It is an arithmetic number, because the mean of its divisors is an integer number (7316249685120).
Almost surely, 253233337551273 is an apocalyptic number.
It is an amenable number.
53233337551273 is a deficient number, since it is larger than the sum of its proper divisors (5296659929687).
53233337551273 is a wasteful number, since it uses less digits than its factorization.
53233337551273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38105467247.
The product of its digits is 17860500, while the sum is 52.
The spelling of 53233337551273 in words is "fifty-three trillion, two hundred thirty-three billion, three hundred thirty-seven million, five hundred fifty-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •