Base | Representation |
---|---|
bin | 1110101101101111110… |
… | …1101110100010010100 |
3 | 220011111221222010101100 |
4 | 3223123331232202110 |
5 | 13120212403313433 |
6 | 312044541030100 |
7 | 24156403515633 |
oct | 3533375564224 |
9 | 804457863340 |
10 | 252798494868 |
11 | 98236183927 |
12 | 40bb1855330 |
13 | 1aab9ab000a |
14 | c34236351a |
15 | 6898857b13 |
hex | 3adbf6e894 |
252798494868 has 72 divisors (see below), whose sum is σ = 665699448960. Its totient is φ = 80817459840.
The previous prime is 252798494863. The next prime is 252798494887. The reversal of 252798494868 is 868494897252.
252798494868 is a `hidden beast` number, since 2 + 5 + 2 + 79 + 8 + 494 + 8 + 68 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 252798494796 and 252798494805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252798494863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1364380 + ... + 1538547.
It is an arithmetic number, because the mean of its divisors is an integer number (9245825680).
Almost surely, 2252798494868 is an apocalyptic number.
It is an amenable number.
252798494868 is an abundant number, since it is smaller than the sum of its proper divisors (412900954092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252798494868 is a wasteful number, since it uses less digits than its factorization.
252798494868 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2903037 (or 2903032 counting only the distinct ones).
The product of its digits is 557383680, while the sum is 72.
The spelling of 252798494868 in words is "two hundred fifty-two billion, seven hundred ninety-eight million, four hundred ninety-four thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •