Base | Representation |
---|---|
bin | 111111101010001… |
… | …011101000001000 |
3 | 2202102200011010202 |
4 | 333222023220020 |
5 | 4141403203110 |
6 | 253551231332 |
7 | 35316016403 |
oct | 7752135010 |
9 | 2672604122 |
10 | 1068022280 |
11 | 4a8963a46 |
12 | 259818548 |
13 | 140365760 |
14 | a1bb6d3a |
15 | 63b6b0a5 |
hex | 3fa8ba08 |
1068022280 has 64 divisors (see below), whose sum is σ = 2740152240. Its totient is φ = 371146752.
The previous prime is 1068022259. The next prime is 1068022289. The reversal of 1068022280 is 822208601.
1068022280 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 8 ways, for example, as 550277764 + 517744516 = 23458^2 + 22754^2 .
It is a super-2 number, since 2×10680222802 = 2281343181152796800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1068022289) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51569 + ... + 69248.
Almost surely, 21068022280 is an apocalyptic number.
1068022280 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1068022280 is an abundant number, since it is smaller than the sum of its proper divisors (1672129960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1068022280 is a wasteful number, since it uses less digits than its factorization.
1068022280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120858 (or 120854 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 29.
The square root of 1068022280 is about 32680.6101534228. The cubic root of 1068022280 is about 1022.1785679915.
The spelling of 1068022280 in words is "one billion, sixty-eight million, twenty-two thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •