Base | Representation |
---|---|
bin | 11101010101000… |
… | …001100010101001 |
3 | 1021021212202112100 |
4 | 131111001202221 |
5 | 2001431104401 |
6 | 120454204013 |
7 | 15123234600 |
oct | 3525014251 |
9 | 1237782470 |
10 | 492050601 |
11 | 232827999 |
12 | 118953609 |
13 | 7ac30a03 |
14 | 494c6a37 |
15 | 2d2e7b86 |
hex | 1d5418a9 |
492050601 has 36 divisors (see below), whose sum is σ = 875426292. Its totient is φ = 264628224.
The previous prime is 492050593. The next prime is 492050623. The reversal of 492050601 is 106050294.
492050601 is a `hidden beast` number, since 4 + 9 + 2 + 0 + 50 + 601 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 373262400 + 118788201 = 19320^2 + 10899^2 .
It is not a de Polignac number, because 492050601 - 23 = 492050593 is a prime.
It is a super-2 number, since 2×4920506012 = 484227587888922402, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (492050641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 25320 + ... + 40313.
It is an arithmetic number, because the mean of its divisors is an integer number (24317397).
Almost surely, 2492050601 is an apocalyptic number.
It is an amenable number.
492050601 is a deficient number, since it is larger than the sum of its proper divisors (383375691).
492050601 is a wasteful number, since it uses less digits than its factorization.
492050601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65670 (or 65660 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 492050601 is about 22182.2136181221. The cubic root of 492050601 is about 789.4717405222.
The spelling of 492050601 in words is "four hundred ninety-two million, fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •