Base | Representation |
---|---|
bin | 110000101111001000… |
… | …110000001001111101 |
3 | 12000001222221100002212 |
4 | 300233020300021331 |
5 | 1324133042243401 |
6 | 40012410430205 |
7 | 3531540216344 |
oct | 605710601175 |
9 | 160058840085 |
10 | 52330431101 |
11 | 20214189473 |
12 | a185432365 |
13 | 4c1c80b140 |
14 | 2766040b5b |
15 | 1564277dbb |
hex | c2f23027d |
52330431101 has 8 divisors (see below), whose sum is σ = 59670899064. Its totient is φ = 45463541760.
The previous prime is 52330431091. The next prime is 52330431187. The reversal of 52330431101 is 10113403325.
It can be written as a sum of positive squares in 4 ways, for example, as 15964322500 + 36366108601 = 126350^2 + 190699^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52330431101 - 26 = 52330431037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52330433101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 118394420 + ... + 118394861.
It is an arithmetic number, because the mean of its divisors is an integer number (7458862383).
Almost surely, 252330431101 is an apocalyptic number.
It is an amenable number.
52330431101 is a deficient number, since it is larger than the sum of its proper divisors (7340467963).
52330431101 is a wasteful number, since it uses less digits than its factorization.
52330431101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236789311.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 52330431101 its reverse (10113403325), we get a palindrome (62443834426).
The spelling of 52330431101 in words is "fifty-two billion, three hundred thirty million, four hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •