Base | Representation |
---|---|
bin | 100110111000010000101… |
… | …101110010100111111000 |
3 | 100110102020212011111122010 |
4 | 212320100231302213320 |
5 | 322233221011104100 |
6 | 5403215100525520 |
7 | 364012313056356 |
oct | 46702055624770 |
9 | 10412225144563 |
10 | 2671750097400 |
11 | 9400a030653a |
12 | 3719778508a0 |
13 | 164c390a62c7 |
14 | 93455d527d6 |
15 | 49771e08750 |
hex | 26e10b729f8 |
2671750097400 has 48 divisors (see below), whose sum is σ = 8282425303800. Its totient is φ = 712466692480.
The previous prime is 2671750097369. The next prime is 2671750097407. The reversal of 2671750097400 is 47900571762.
It is a happy number.
2671750097400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 2671750097400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2671750097407) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2226457815 + ... + 2226459014.
Almost surely, 22671750097400 is an apocalyptic number.
2671750097400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2671750097400 is an abundant number, since it is smaller than the sum of its proper divisors (5610675206400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2671750097400 is a wasteful number, since it uses less digits than its factorization.
2671750097400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4452916848 (or 4452916839 counting only the distinct ones).
The product of its (nonzero) digits is 740880, while the sum is 48.
The spelling of 2671750097400 in words is "two trillion, six hundred seventy-one billion, seven hundred fifty million, ninety-seven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •