Base | Representation |
---|---|
bin | 110000101010111100… |
… | …011110001000101111 |
3 | 11222220002121021200101 |
4 | 300222330132020233 |
5 | 1324012041241303 |
6 | 40001415211531 |
7 | 3530024354314 |
oct | 605274361057 |
9 | 158802537611 |
10 | 52260102703 |
11 | 20188513726 |
12 | a165976ba7 |
13 | 4c0b085cc3 |
14 | 275a974d0b |
15 | 155ced4d1d |
hex | c2af1e22f |
52260102703 has 4 divisors (see below), whose sum is σ = 54062175240. Its totient is φ = 50458030168.
The previous prime is 52260102599. The next prime is 52260102709. The reversal of 52260102703 is 30720106225.
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-52260102703 is a prime.
It is a super-2 number, since 2×522601027032 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52260102709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 901036225 + ... + 901036282.
It is an arithmetic number, because the mean of its divisors is an integer number (13515543810).
Almost surely, 252260102703 is an apocalyptic number.
52260102703 is a deficient number, since it is larger than the sum of its proper divisors (1802072537).
52260102703 is a wasteful number, since it uses less digits than its factorization.
52260102703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1802072536.
The product of its (nonzero) digits is 5040, while the sum is 28.
Adding to 52260102703 its reverse (30720106225), we get a palindrome (82980208928).
The spelling of 52260102703 in words is "fifty-two billion, two hundred sixty million, one hundred two thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •