Base | Representation |
---|---|
bin | 110000100101000… |
… | …1001110100100101 |
3 | 11012121020012110021 |
4 | 1201022021310211 |
5 | 11314243122441 |
6 | 425425355141 |
7 | 55252132042 |
oct | 14112116445 |
9 | 4177205407 |
10 | 1630051621 |
11 | 767137a00 |
12 | 395a98ab1 |
13 | 1cc9283b3 |
14 | 1166b81c9 |
15 | 981883d1 |
hex | 61289d25 |
1630051621 has 6 divisors (see below), whose sum is σ = 1791709766. Its totient is φ = 1481865000.
The previous prime is 1630051609. The next prime is 1630051627. The reversal of 1630051621 is 1261500361.
It can be written as a sum of positive squares in only one way, i.e., 1629736900 + 314721 = 40370^2 + 561^2 .
It is a de Polignac number, because none of the positive numbers 2k-1630051621 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1630051627) 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 5 ways as a sum of consecutive naturals, for example, 6735630 + ... + 6735871.
Almost surely, 21630051621 is an apocalyptic number.
1630051621 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1630051621 is a deficient number, since it is larger than the sum of its proper divisors (161658145).
1630051621 is a wasteful number, since it uses less digits than its factorization.
1630051621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13471523 (or 13471512 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 1630051621 is about 40373.8977682363. The cubic root of 1630051621 is about 1176.8843453483.
Adding to 1630051621 its reverse (1261500361), we get a palindrome (2891551982).
The spelling of 1630051621 in words is "one billion, six hundred thirty million, fifty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •