Base | Representation |
---|---|
bin | 1010000000011111… |
… | …1101011001100100 |
3 | 20221020000100100001 |
4 | 2200013331121210 |
5 | 21000212103220 |
6 | 1122323431044 |
7 | 123400241452 |
oct | 24007753144 |
9 | 6836010301 |
10 | 2686441060 |
11 | 1159475a26 |
12 | 62b825484 |
13 | 33a749cc4 |
14 | 1b6b039d2 |
15 | 10aca780a |
hex | a01fd664 |
2686441060 has 12 divisors (see below), whose sum is σ = 5641526268. Its totient is φ = 1074576416.
The previous prime is 2686441049. The next prime is 2686441063. The reversal of 2686441060 is 601446862.
It can be written as a sum of positive squares in 2 ways, for example, as 780420096 + 1906020964 = 27936^2 + 43658^2 .
It is a super-5 number, since 5×26864410605 (a number of 48 digits) contains 55555 as substring.
It is not an unprimeable number, because it can be changed into a prime (2686441063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67161007 + ... + 67161046.
It is an arithmetic number, because the mean of its divisors is an integer number (470127189).
Almost surely, 22686441060 is an apocalyptic number.
2686441060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2686441060 is an abundant number, since it is smaller than the sum of its proper divisors (2955085208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2686441060 is a wasteful number, since it uses less digits than its factorization.
2686441060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134322062 (or 134322060 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 37.
The square root of 2686441060 is about 51830.8890527647. The cubic root of 2686441060 is about 1390.1418104890.
The spelling of 2686441060 in words is "two billion, six hundred eighty-six million, four hundred forty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •