Base | Representation |
---|---|
bin | 1110010101101000110… |
… | …00100101000101000101 |
3 | 1202002121210210211101112 |
4 | 13022310120211011011 |
5 | 31032423032121312 |
6 | 1014153235134405 |
7 | 50410251060650 |
oct | 7126430450505 |
9 | 1662553724345 |
10 | 492652613957 |
11 | 17aa29614629 |
12 | 7b590444405 |
13 | 375c2b9567a |
14 | 19bb74ba897 |
15 | cc35a99d22 |
hex | 72b4625145 |
492652613957 has 8 divisors (see below), whose sum is σ = 563037684096. Its totient is φ = 422269075152.
The previous prime is 492652613939. The next prime is 492652613969. The reversal of 492652613957 is 759316256294.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 492652613957 - 212 = 492652609861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 492652613896 and 492652613905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (492652663957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 418343 + ... + 1077179.
It is an arithmetic number, because the mean of its divisors is an integer number (70379710512).
Almost surely, 2492652613957 is an apocalyptic number.
It is an amenable number.
492652613957 is a deficient number, since it is larger than the sum of its proper divisors (70385070139).
492652613957 is a wasteful number, since it uses less digits than its factorization.
492652613957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765667.
The product of its digits is 24494400, while the sum is 59.
The spelling of 492652613957 in words is "four hundred ninety-two billion, six hundred fifty-two million, six hundred thirteen thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •