Base | Representation |
---|---|
bin | 100101100011110… |
… | …001011100101000 |
3 | 1121220201011010100 |
4 | 211203301130220 |
5 | 2242303301233 |
6 | 142305545400 |
7 | 21421025010 |
oct | 4543613450 |
9 | 1556634110 |
10 | 630134568 |
11 | 2a3770478 |
12 | 157045260 |
13 | a0719bbb |
14 | 5d98cc40 |
15 | 3a4c1813 |
hex | 258f1728 |
630134568 has 96 divisors (see below), whose sum is σ = 2003189760. Its totient is φ = 175167360.
The previous prime is 630134567. The next prime is 630134623. The reversal of 630134568 is 865431036.
630134568 is a `hidden beast` number, since 6 + 301 + 345 + 6 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (630134567) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1753 + ... + 35543.
It is an arithmetic number, because the mean of its divisors is an integer number (20866560).
Almost surely, 2630134568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 630134568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1001594880).
630134568 is an abundant number, since it is smaller than the sum of its proper divisors (1373055192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630134568 is a wasteful number, since it uses less digits than its factorization.
630134568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33847 (or 33840 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 630134568 is about 25102.4813116154. The cubic root of 630134568 is about 857.3229209325.
The spelling of 630134568 in words is "six hundred thirty million, one hundred thirty-four thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •