Base | Representation |
---|---|
bin | 100110101101110101011… |
… | …0111111001001100110001 |
3 | 200211200201022021221200211 |
4 | 1031123222313321030301 |
5 | 1144140113132030301 |
6 | 15152252330544121 |
7 | 1056303032003014 |
oct | 115335267711461 |
9 | 20750638257624 |
10 | 5321110033201 |
11 | 1771740990196 |
12 | 71b324b98041 |
13 | 2c7a17552181 |
14 | 1457863a137b |
15 | 93633315051 |
hex | 4d6eadf9331 |
5321110033201 has 4 divisors (see below), whose sum is σ = 5504596586100. Its totient is φ = 5137623480304.
The previous prime is 5321110033171. The next prime is 5321110033223. The reversal of 5321110033201 is 1023300111235.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3328439008801 + 1992671024400 = 1824401^2 + 1411620^2 .
It is a cyclic number.
It is not a de Polignac number, because 5321110033201 - 215 = 5321110000433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5321110033501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91743276406 + ... + 91743276463.
It is an arithmetic number, because the mean of its divisors is an integer number (1376149146525).
Almost surely, 25321110033201 is an apocalyptic number.
It is an amenable number.
5321110033201 is a deficient number, since it is larger than the sum of its proper divisors (183486552899).
5321110033201 is a wasteful number, since it uses less digits than its factorization.
5321110033201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183486552898.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 5321110033201 its reverse (1023300111235), we get a palindrome (6344410144436).
The spelling of 5321110033201 in words is "five trillion, three hundred twenty-one billion, one hundred ten million, thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •