Base | Representation |
---|---|
bin | 1001110001011000… |
… | …1100001001110000 |
3 | 20202210202101111011 |
4 | 2130112030021300 |
5 | 20333001001030 |
6 | 1112141200304 |
7 | 122000443642 |
oct | 23426141160 |
9 | 6683671434 |
10 | 2623062640 |
11 | 1126717870 |
12 | 612560094 |
13 | 32a589393 |
14 | 1ac526892 |
15 | 105438b2a |
hex | 9c58c270 |
2623062640 has 40 divisors (see below), whose sum is σ = 6653042928. Its totient is φ = 953840640.
The previous prime is 2623062619. The next prime is 2623062641. The reversal of 2623062640 is 462603262.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×26230626402 = 13760915226727539200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2623062641) 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 7 ways as a sum of consecutive naturals, for example, 1489497 + ... + 1491256.
Almost surely, 22623062640 is an apocalyptic number.
2623062640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2623062640 is an abundant number, since it is smaller than the sum of its proper divisors (4029980288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2623062640 is a wasteful number, since it uses less digits than its factorization.
2623062640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2980777 (or 2980771 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
The square root of 2623062640 is about 51215.8436423730. The cubic root of 2623062640 is about 1379.1226377249.
The spelling of 2623062640 in words is "two billion, six hundred twenty-three million, sixty-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •