Base | Representation |
---|---|
bin | 100010101010001011100… |
… | …0100110101100100110100 |
3 | 121212101102220200211010212 |
4 | 1011110113010311210310 |
5 | 1111021130001002002 |
6 | 14044154022404552 |
7 | 1001103054604025 |
oct | 105242704654464 |
9 | 17771386624125 |
10 | 4763505875252 |
11 | 1577211978293 |
12 | 64b248590758 |
13 | 287273138447 |
14 | 1267aa984c4c |
15 | 83d9a483352 |
hex | 45517135934 |
4763505875252 has 48 divisors (see below), whose sum is σ = 8836629918480. Its totient is φ = 2239077261312.
The previous prime is 4763505875237. The next prime is 4763505875263. The reversal of 4763505875252 is 2525785053674.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 66030497296 + 4697475377956 = 256964^2 + 2167366^2 .
It is a junction number, because it is equal to n+sod(n) for n = 4763505875191 and 4763505875200.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 588882824 + ... + 588890912.
It is an arithmetic number, because the mean of its divisors is an integer number (184096456635).
Almost surely, 24763505875252 is an apocalyptic number.
It is an amenable number.
4763505875252 is a deficient number, since it is larger than the sum of its proper divisors (4073124043228).
4763505875252 is a wasteful number, since it uses less digits than its factorization.
4763505875252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16980 (or 16978 counting only the distinct ones).
The product of its (nonzero) digits is 70560000, while the sum is 59.
The spelling of 4763505875252 in words is "four trillion, seven hundred sixty-three billion, five hundred five million, eight hundred seventy-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •