Base | Representation |
---|---|
bin | 110000100101001… |
… | …1010110100000000 |
3 | 11012121100201220212 |
4 | 1201022122310000 |
5 | 11314302334331 |
6 | 425431053252 |
7 | 55252541663 |
oct | 14112326400 |
9 | 4177321825 |
10 | 1630121216 |
11 | 767185219 |
12 | 395b11228 |
13 | 1cc950c89 |
14 | 1166d56da |
15 | 9819dd2b |
hex | 6129ad00 |
1630121216 has 36 divisors (see below), whose sum is σ = 3256466052. Its totient is φ = 814411776.
The previous prime is 1630121209. The next prime is 1630121221. The reversal of 1630121216 is 6121210361.
It can be written as a sum of positive squares in 2 ways, for example, as 357058816 + 1273062400 = 18896^2 + 35680^2 .
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 1630121191 and 1630121200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 585620 + ... + 588396.
Almost surely, 21630121216 is an apocalyptic number.
1630121216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1630121216 is a deficient number, since it is larger than the sum of its proper divisors (1626344836).
1630121216 is an equidigital number, since it uses as much as digits as its factorization.
1630121216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5086 (or 5072 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 1630121216 is about 40374.7596401514. The cubic root of 1630121216 is about 1176.9010941226.
Adding to 1630121216 its reverse (6121210361), we get a palindrome (7751331577).
The spelling of 1630121216 in words is "one billion, six hundred thirty million, one hundred twenty-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •