Base | Representation |
---|---|
bin | 1001111010100101… |
… | …0001111010110001 |
3 | 20212111022101012022 |
4 | 2132221101322301 |
5 | 20422333341200 |
6 | 1120035441225 |
7 | 122646260141 |
oct | 23651217261 |
9 | 6774271168 |
10 | 2661621425 |
11 | 1146463631 |
12 | 623456215 |
13 | 335569c28 |
14 | 1b36c2921 |
15 | 108a03885 |
hex | 9ea51eb1 |
2661621425 has 12 divisors (see below), whose sum is σ = 3301090800. Its totient is φ = 2128858320.
The previous prime is 2661621407. The next prime is 2661621427. The reversal of 2661621425 is 5241261662.
It is not a de Polignac number, because 2661621425 - 226 = 2594512561 is a prime.
It is a super-2 number, since 2×26616214252 = 14168457220038061250, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2661621427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 173726 + ... + 188424.
It is an arithmetic number, because the mean of its divisors is an integer number (275090900).
Almost surely, 22661621425 is an apocalyptic number.
2661621425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2661621425 is a deficient number, since it is larger than the sum of its proper divisors (639469375).
2661621425 is a wasteful number, since it uses less digits than its factorization.
2661621425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21952 (or 21947 counting only the distinct ones).
The product of its digits is 34560, while the sum is 35.
The square root of 2661621425 is about 51590.9044793750. The cubic root of 2661621425 is about 1385.8474527874.
The spelling of 2661621425 in words is "two billion, six hundred sixty-one million, six hundred twenty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •