Base | Representation |
---|---|
bin | 111110101100100… |
… | …1110100111011100 |
3 | 12102121121100200120 |
4 | 1331121032213130 |
5 | 13302030443333 |
6 | 544430554540 |
7 | 103063466010 |
oct | 17531164734 |
9 | 5377540616 |
10 | 2103765468 |
11 | 98a580152 |
12 | 4a8668a50 |
13 | 276b08a4c |
14 | 15d58a540 |
15 | c4a5cdb3 |
hex | 7d64e9dc |
2103765468 has 24 divisors (see below), whose sum is σ = 5610041472. Its totient is φ = 601075824.
The previous prime is 2103765463. The next prime is 2103765479. The reversal of 2103765468 is 8645673012.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103765463) 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, 12522330 + ... + 12522497.
It is an arithmetic number, because the mean of its divisors is an integer number (233751728).
Almost surely, 22103765468 is an apocalyptic number.
2103765468 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
2103765468 is an abundant number, since it is smaller than the sum of its proper divisors (3506276004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2103765468 is a wasteful number, since it uses less digits than its factorization.
2103765468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25044841 (or 25044839 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 42.
The square root of 2103765468 is about 45866.8231731826. The cubic root of 2103765468 is about 1281.3441016017.
The spelling of 2103765468 in words is "two billion, one hundred three million, seven hundred sixty-five thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •