Base | Representation |
---|---|
bin | 11000001111001111000011… |
… | …00111001001110000010001 |
3 | 20222201102201000220212020120 |
4 | 30013213201213021300101 |
5 | 23441231432241010413 |
6 | 305205410413300453 |
7 | 14140541352312261 |
oct | 1407474147116021 |
9 | 228642630825216 |
10 | 53300034313233 |
11 | 15a8a465928104 |
12 | 5b89aa1794729 |
13 | 2398230206a66 |
14 | d23a420157a1 |
15 | 6266c9a8e723 |
hex | 3079e19c9c11 |
53300034313233 has 8 divisors (see below), whose sum is σ = 71196633283488. Its totient is φ = 35468395775904.
The previous prime is 53300034313117. The next prime is 53300034313237. The reversal of 53300034313233 is 33231343000335.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-53300034313233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53300034313194 and 53300034313203.
It is not an unprimeable number, because it can be changed into a prime (53300034313237) 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, 16240106316 + ... + 16240109597.
It is an arithmetic number, because the mean of its divisors is an integer number (8899579160436).
Almost surely, 253300034313233 is an apocalyptic number.
It is an amenable number.
53300034313233 is a deficient number, since it is larger than the sum of its proper divisors (17896598970255).
53300034313233 is a wasteful number, since it uses less digits than its factorization.
53300034313233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32480216463.
The product of its (nonzero) digits is 87480, while the sum is 33.
Adding to 53300034313233 its reverse (33231343000335), we get a palindrome (86531377313568).
The spelling of 53300034313233 in words is "fifty-three trillion, three hundred billion, thirty-four million, three hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •