Base | Representation |
---|---|
bin | 100101110110111011100… |
… | …000110100101010101000 |
3 | 100012201012001120011001001 |
4 | 211312323200310222220 |
5 | 320111034344022200 |
6 | 5311054205404344 |
7 | 355650046654441 |
oct | 45667340645250 |
9 | 10181161504031 |
10 | 2601601157800 |
11 | 913373036997 |
12 | 36025ab696b4 |
13 | 15b439b41618 |
14 | 8dcbd64a2c8 |
15 | 47a186c776a |
hex | 25dbb834aa8 |
2601601157800 has 48 divisors (see below), whose sum is σ = 6049583097660. Its totient is φ = 1040492436480.
The previous prime is 2601601157789. The next prime is 2601601157819. The reversal of 2601601157800 is 87511061062.
2601601157800 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 2148340981284 + 453260176516 = 1465722^2 + 673246^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 2601601157800.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 489762 + ... + 2333038.
Almost surely, 22601601157800 is an apocalyptic number.
2601601157800 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2601601157800 is an abundant number, since it is smaller than the sum of its proper divisors (3447981939860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2601601157800 is a wasteful number, since it uses less digits than its factorization.
2601601157800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1850350 (or 1850341 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 37.
The spelling of 2601601157800 in words is "two trillion, six hundred one billion, six hundred one million, one hundred fifty-seven thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •