Base | Representation |
---|---|
bin | 100110100001010… |
… | …010011000000100 |
3 | 1200001001102101000 |
4 | 212201102120010 |
5 | 2310420311403 |
6 | 144043333300 |
7 | 22005056415 |
oct | 4641223004 |
9 | 1601042330 |
10 | 646260228 |
11 | 301884969 |
12 | 160521230 |
13 | a3b74a03 |
14 | 61b8980c |
15 | 3bb097a3 |
hex | 26852604 |
646260228 has 48 divisors (see below), whose sum is σ = 1677195520. Its totient is φ = 215200800.
The previous prime is 646260227. The next prime is 646260229. The reversal of 646260228 is 822062646.
646260228 is a `hidden beast` number, since 6 + 4 + 626 + 0 + 2 + 28 = 666.
It is an interprime number because it is at equal distance from previous prime (646260227) and next prime (646260229).
It is a super-2 number, since 2×6462602282 = 835304564589223968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 646260192 and 646260201.
It is not an unprimeable number, because it can be changed into a prime (646260227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130518 + ... + 135378.
Almost surely, 2646260228 is an apocalyptic number.
It is an amenable number.
646260228 is an abundant number, since it is smaller than the sum of its proper divisors (1030935292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
646260228 is a wasteful number, since it uses less digits than its factorization.
646260228 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6105 (or 6097 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 36.
The square root of 646260228 is about 25421.6488056932. The cubic root of 646260228 is about 864.5746081238.
The spelling of 646260228 in words is "six hundred forty-six million, two hundred sixty thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •