Base | Representation |
---|---|
bin | 1001110001000011… |
… | …1000111010000010 |
3 | 20202201010210101100 |
4 | 2130100320322002 |
5 | 20332122014330 |
6 | 1112051315230 |
7 | 121652565531 |
oct | 23420707202 |
9 | 6681123340 |
10 | 2621673090 |
11 | 1125958883 |
12 | 611babb16 |
13 | 32a1c0a6a |
14 | 1ac284318 |
15 | 105262060 |
hex | 9c438e82 |
2621673090 has 96 divisors (see below), whose sum is σ = 7041031920. Its totient is φ = 676435968.
The previous prime is 2621673077. The next prime is 2621673091. The reversal of 2621673090 is 903761262.
It can be written as a sum of positive squares in 8 ways, for example, as 1287159129 + 1334513961 = 35877^2 + 36531^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2621673091) 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 47 ways as a sum of consecutive naturals, for example, 344446 + ... + 351974.
Almost surely, 22621673090 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2621673090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3520515960).
2621673090 is an abundant number, since it is smaller than the sum of its proper divisors (4419358830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2621673090 is a wasteful number, since it uses less digits than its factorization.
2621673090 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7668 (or 7665 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 2621673090 is about 51202.2762189339. The cubic root of 2621673090 is about 1378.8790676929.
The spelling of 2621673090 in words is "two billion, six hundred twenty-one million, six hundred seventy-three thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •