Base | Representation |
---|---|
bin | 10111110010110001111110… |
… | …01001110110000001010001 |
3 | 20212020222010121112221202202 |
4 | 23321120333021312001101 |
5 | 23324222133343120131 |
6 | 303140320054052545 |
7 | 14010110431433645 |
oct | 1371307711660121 |
9 | 225228117487682 |
10 | 52322351145041 |
11 | 1574286a1a926a |
12 | 5a5050964a155 |
13 | 2326c90602353 |
14 | ccc5b5864c25 |
15 | 60b05768cbcb |
hex | 2f963f276051 |
52322351145041 has 8 divisors (see below), whose sum is σ = 55400924941920. Its totient is φ = 49243864952128.
The previous prime is 52322351145017. The next prime is 52322351145059. The reversal of 52322351145041 is 14054115322325.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52322351145041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52322351144986 and 52322351145004.
It is not an unprimeable number, because it can be changed into a prime (52322351145061) 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, 20669351 + ... + 23062236.
It is an arithmetic number, because the mean of its divisors is an integer number (6925115617740).
Almost surely, 252322351145041 is an apocalyptic number.
It is an amenable number.
52322351145041 is a deficient number, since it is larger than the sum of its proper divisors (3078573796879).
52322351145041 is a wasteful number, since it uses less digits than its factorization.
52322351145041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43801983.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 52322351145041 its reverse (14054115322325), we get a palindrome (66376466467366).
The spelling of 52322351145041 in words is "fifty-two trillion, three hundred twenty-two billion, three hundred fifty-one million, one hundred forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •