Base | Representation |
---|---|
bin | 1110101101100101101… |
… | …0100010001011000101 |
3 | 220011101222110200002210 |
4 | 3223121122202023011 |
5 | 13120120430333012 |
6 | 312040412054033 |
7 | 24155344061400 |
oct | 3533132421305 |
9 | 804358420083 |
10 | 252755714757 |
11 | 98214014567 |
12 | 40b9b464319 |
13 | 1aab0c81c40 |
14 | c33a7c8d37 |
15 | 6894c0723c |
hex | 3ad96a22c5 |
252755714757 has 96 divisors (see below), whose sum is σ = 447777590400. Its totient is φ = 125266563072.
The previous prime is 252755714737. The next prime is 252755714773. The reversal of 252755714757 is 757417557252.
252755714757 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 252755714757 - 28 = 252755714501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 252755714697 and 252755714706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252755714737) 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 95 ways as a sum of consecutive naturals, for example, 20103169 + ... + 20115737.
It is an arithmetic number, because the mean of its divisors is an integer number (4664349900).
Almost surely, 2252755714757 is an apocalyptic number.
It is an amenable number.
252755714757 is a deficient number, since it is larger than the sum of its proper divisors (195021875643).
252755714757 is a wasteful number, since it uses less digits than its factorization.
252755714757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13235 (or 13228 counting only the distinct ones).
The product of its digits is 24010000, while the sum is 57.
The spelling of 252755714757 in words is "two hundred fifty-two billion, seven hundred fifty-five million, seven hundred fourteen thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •