Base | Representation |
---|---|
bin | 10111101101110111101011… |
… | …11010001001111100011001 |
3 | 20211122211121100110002020212 |
4 | 23312323311322021330121 |
5 | 23313441102323233113 |
6 | 302531012553300505 |
7 | 13661655200300210 |
oct | 1366736572117431 |
9 | 224584540402225 |
10 | 52153618571033 |
11 | 1568825304aaa1 |
12 | 5a23879404735 |
13 | 23140b0119795 |
14 | cc436a270077 |
15 | 60697e24b0a8 |
hex | 2f6ef5e89f19 |
52153618571033 has 4 divisors (see below), whose sum is σ = 59604135509760. Its totient is φ = 44703101632308.
The previous prime is 52153618570993. The next prime is 52153618571111. The reversal of 52153618571033 is 33017581635125.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 52153618571033 - 26 = 52153618570969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52153618573033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3725258469353 + ... + 3725258469366.
It is an arithmetic number, because the mean of its divisors is an integer number (14901033877440).
Almost surely, 252153618571033 is an apocalyptic number.
It is an amenable number.
52153618571033 is a deficient number, since it is larger than the sum of its proper divisors (7450516938727).
52153618571033 is an equidigital number, since it uses as much as digits as its factorization.
52153618571033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7450516938726.
The product of its (nonzero) digits is 2268000, while the sum is 50.
The spelling of 52153618571033 in words is "fifty-two trillion, one hundred fifty-three billion, six hundred eighteen million, five hundred seventy-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •