Base | Representation |
---|---|
bin | 100110111100011110011… |
… | …1001101111101010010001 |
3 | 200221200212111001121222212 |
4 | 1031320330321233222101 |
5 | 1200144011030134301 |
6 | 15214532240241505 |
7 | 1061465126666036 |
oct | 115707471575221 |
9 | 20850774047885 |
10 | 5352551021201 |
11 | 178400556889a |
12 | 72543a610295 |
13 | 2ca988317197 |
14 | 1470c9d4b38d |
15 | 943736cd4bb |
hex | 4de3ce6fa91 |
5352551021201 has 4 divisors (see below), whose sum is σ = 5537121746100. Its totient is φ = 5167980296304.
The previous prime is 5352551021197. The next prime is 5352551021203. The reversal of 5352551021201 is 1021201552535.
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 3391486876801 + 1961064144400 = 1841599^2 + 1400380^2 .
It is a cyclic number.
It is not a de Polignac number, because 5352551021201 - 22 = 5352551021197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5352551021203) 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, 92285362406 + ... + 92285362463.
It is an arithmetic number, because the mean of its divisors is an integer number (1384280436525).
Almost surely, 25352551021201 is an apocalyptic number.
It is an amenable number.
5352551021201 is a deficient number, since it is larger than the sum of its proper divisors (184570724899).
5352551021201 is a wasteful number, since it uses less digits than its factorization.
5352551021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184570724898.
The product of its (nonzero) digits is 15000, while the sum is 32.
Adding to 5352551021201 its reverse (1021201552535), we get a palindrome (6373752573736).
The spelling of 5352551021201 in words is "five trillion, three hundred fifty-two billion, five hundred fifty-one million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •