Base | Representation |
---|---|
bin | 111101010000010… |
… | …011110000000100 |
3 | 2122121202211022111 |
4 | 331100103300010 |
5 | 4101041413010 |
6 | 245550510404 |
7 | 34316116201 |
oct | 7520236004 |
9 | 2577684274 |
10 | 1027685380 |
11 | 488113267 |
12 | 248205404 |
13 | 134bb1777 |
14 | 9a6b6ca8 |
15 | 6034e58a |
hex | 3d413c04 |
1027685380 has 48 divisors (see below), whose sum is σ = 2224474560. Its totient is φ = 398579328.
The previous prime is 1027685363. The next prime is 1027685401. The reversal of 1027685380 is 835867201.
It is a super-2 number, since 2×10276853802 = 2112274480531488800, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115242 + ... + 123838.
It is an arithmetic number, because the mean of its divisors is an integer number (46343220).
Almost surely, 21027685380 is an apocalyptic number.
1027685380 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1027685380, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1112237280).
1027685380 is an abundant number, since it is smaller than the sum of its proper divisors (1196789180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1027685380 is a wasteful number, since it uses less digits than its factorization.
1027685380 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8788 (or 8786 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 40.
The square root of 1027685380 is about 32057.5323442089. The cubic root of 1027685380 is about 1009.1445817248.
The spelling of 1027685380 in words is "one billion, twenty-seven million, six hundred eighty-five thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •