Base | Representation |
---|---|
bin | 10010010101101000101… |
… | …00001000000000000000 |
3 | 2020020101002020202000000 |
4 | 21022310110020000000 |
5 | 40310411120242434 |
6 | 1201243132000000 |
7 | 63344141012661 |
oct | 11126424100000 |
9 | 2206332222000 |
10 | 630090399744 |
11 | 223246671263 |
12 | a2148000000 |
13 | 47556984480 |
14 | 226d4701368 |
15 | 115cb8a1b99 |
hex | 92b4508000 |
630090399744 has 448 divisors, whose sum is σ = 2035717637100. Its totient is φ = 193778417664.
The previous prime is 630090399677. The next prime is 630090399751. The reversal of 630090399744 is 447993090036.
It can be written as a sum of positive squares in 2 ways, for example, as 615459078144 + 14631321600 = 784512^2 + 120960^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 310541322 + ... + 310543350.
Almost surely, 2630090399744 is an apocalyptic number.
630090399744 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 630090399744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1017858818550).
630090399744 is an abundant number, since it is smaller than the sum of its proper divisors (1405627237356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630090399744 is an frugal number, since it uses more digits than its factorization.
630090399744 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2090 (or 2047 counting only the distinct ones).
The product of its (nonzero) digits is 4408992, while the sum is 54.
The spelling of 630090399744 in words is "six hundred thirty billion, ninety million, three hundred ninety-nine thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •