Base | Representation |
---|---|
bin | 111100111111110… |
… | …1001000111110000 |
3 | 12021122021111010101 |
4 | 1321333221013300 |
5 | 13142430223030 |
6 | 535032242144 |
7 | 101501614030 |
oct | 17177510760 |
9 | 5248244111 |
10 | 2046726640 |
11 | 960362022 |
12 | 491540354 |
13 | 26805786a |
14 | 155b7d8c0 |
15 | bea427ca |
hex | 79fe91f0 |
2046726640 has 80 divisors (see below), whose sum is σ = 5613926400. Its totient is φ = 679092480.
The previous prime is 2046726637. The next prime is 2046726739. The reversal of 2046726640 is 466276402.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 2046726640.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41590 + ... + 76309.
It is an arithmetic number, because the mean of its divisors is an integer number (70174080).
Almost surely, 22046726640 is an apocalyptic number.
2046726640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2046726640 is an abundant number, since it is smaller than the sum of its proper divisors (3567199760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2046726640 is a wasteful number, since it uses less digits than its factorization.
2046726640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117950 (or 117944 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 37.
The square root of 2046726640 is about 45240.7630351213. The cubic root of 2046726640 is about 1269.6575926065.
The spelling of 2046726640 in words is "two billion, forty-six million, seven hundred twenty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •