Base | Representation |
---|---|
bin | 10111110011100110011101… |
… | …10011101000011011111011 |
3 | 20212100122212112000012102111 |
4 | 23321303032303220123323 |
5 | 23330202341421420430 |
6 | 303201300231113151 |
7 | 14012125650562012 |
oct | 1371631663503373 |
9 | 225318775005374 |
10 | 52350531045115 |
11 | 1575380aaaa286 |
12 | 5a55a72b127b7 |
13 | 232983188a634 |
14 | ccdaca283a79 |
15 | 60bb565dcc2a |
hex | 2f9ccece86fb |
52350531045115 has 4 divisors (see below), whose sum is σ = 62820637254144. Its totient is φ = 41880424836088.
The previous prime is 52350531045091. The next prime is 52350531045191. The reversal of 52350531045115 is 51154013505325.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52350531045115 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
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, 5235053104507 + ... + 5235053104516.
It is an arithmetic number, because the mean of its divisors is an integer number (15705159313536).
Almost surely, 252350531045115 is an apocalyptic number.
52350531045115 is a deficient number, since it is larger than the sum of its proper divisors (10470106209029).
52350531045115 is a wasteful number, since it uses less digits than its factorization.
52350531045115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10470106209028.
The product of its (nonzero) digits is 225000, while the sum is 40.
The spelling of 52350531045115 in words is "fifty-two trillion, three hundred fifty billion, five hundred thirty-one million, forty-five thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •