Base | Representation |
---|---|
bin | 110100101100010… |
… | …1011010011111100 |
3 | 11120012221121001022 |
4 | 1221120223103330 |
5 | 12110111422130 |
6 | 451240003312 |
7 | 61546255046 |
oct | 15130532374 |
9 | 4505847038 |
10 | 1768076540 |
11 | 82804008a |
12 | 414160538 |
13 | 2223c3749 |
14 | 12ab66a96 |
15 | a534e7e5 |
hex | 6962b4fc |
1768076540 has 24 divisors (see below), whose sum is σ = 3908380560. Its totient is φ = 670007808.
The previous prime is 1768076533. The next prime is 1768076543. The reversal of 1768076540 is 456708671.
It is a junction number, because it is equal to n+sod(n) for n = 1768076491 and 1768076500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1768076543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2326037 + ... + 2326796.
It is an arithmetic number, because the mean of its divisors is an integer number (162849190).
Almost surely, 21768076540 is an apocalyptic number.
1768076540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1768076540 is an abundant number, since it is smaller than the sum of its proper divisors (2140304020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1768076540 is a wasteful number, since it uses less digits than its factorization.
1768076540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4652861 (or 4652859 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 44.
The square root of 1768076540 is about 42048.5022325409. The cubic root of 1768076540 is about 1209.2061682917.
The spelling of 1768076540 in words is "one billion, seven hundred sixty-eight million, seventy-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •