Base | Representation |
---|---|
bin | 1110101101010100000… |
… | …1010110000101010111 |
3 | 220011012211202201021101 |
4 | 3223111001112011113 |
5 | 13114443043042100 |
6 | 312025220130531 |
7 | 24153460404556 |
oct | 3532501260527 |
9 | 804184681241 |
10 | 252682002775 |
11 | 98186448674 |
12 | 40b7a836a47 |
13 | 1aa9b913997 |
14 | c330abbd9d |
15 | 688d4e686a |
hex | 3ad5056157 |
252682002775 has 24 divisors (see below), whose sum is σ = 321650466624. Its totient is φ = 196819353600.
The previous prime is 252682002773. The next prime is 252682002779. The reversal of 252682002775 is 577200286252.
252682002775 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 252682002775 - 21 = 252682002773 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 (252682002773) 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 23 ways as a sum of consecutive naturals, for example, 330346 + ... + 783895.
It is an arithmetic number, because the mean of its divisors is an integer number (13402102776).
Almost surely, 2252682002775 is an apocalyptic number.
252682002775 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
252682002775 is a deficient number, since it is larger than the sum of its proper divisors (68968463849).
252682002775 is a wasteful number, since it uses less digits than its factorization.
252682002775 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1114491 (or 1114486 counting only the distinct ones).
The product of its (nonzero) digits is 940800, while the sum is 46.
The spelling of 252682002775 in words is "two hundred fifty-two billion, six hundred eighty-two million, two thousand, seven hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •