Base | Representation |
---|---|
bin | 1001111101110111… |
… | …0111111100000000 |
3 | 20220110020211200220 |
4 | 2133131313330000 |
5 | 20434401034030 |
6 | 1121251143040 |
7 | 123204412122 |
oct | 23735677400 |
9 | 6813224626 |
10 | 2675408640 |
11 | 1153220123 |
12 | 627ba4a80 |
13 | 338386548 |
14 | 1b5471212 |
15 | 109d28a10 |
hex | 9f777f00 |
2675408640 has 72 divisors (see below), whose sum is σ = 8544598608. Its totient is φ = 713441280.
The previous prime is 2675408627. The next prime is 2675408647. The reversal of 2675408640 is 468045762.
It is a super-2 number, since 2×26754086402 = 14315622781973299200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2675408592 and 2675408601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2675408647) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 344521 + ... + 352200.
Almost surely, 22675408640 is an apocalyptic number.
2675408640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2675408640 is an abundant number, since it is smaller than the sum of its proper divisors (5869189968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2675408640 is an equidigital number, since it uses as much as digits as its factorization.
2675408640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696745 (or 696731 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 42.
The square root of 2675408640 is about 51724.3524850723. The cubic root of 2675408640 is about 1388.2362322743.
The spelling of 2675408640 in words is "two billion, six hundred seventy-five million, four hundred eight thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •