Base | Representation |
---|---|
bin | 101000100100000… |
… | …0011100100101000 |
3 | 10111212002022221020 |
4 | 1101020003210220 |
5 | 10241413110110 |
6 | 343020212440 |
7 | 45504605160 |
oct | 12110034450 |
9 | 3455068836 |
10 | 1361066280 |
11 | 639317272 |
12 | 31b99a120 |
13 | 188c99382 |
14 | cca995a0 |
15 | 7e753d70 |
hex | 51203928 |
1361066280 has 256 divisors, whose sum is σ = 4914432000. Its totient is φ = 294970368.
The previous prime is 1361066227. The next prime is 1361066297. The reversal of 1361066280 is 826601631.
It is a super-3 number, since 3×13610662803 (a number of 28 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1436767 + ... + 1437713.
It is an arithmetic number, because the mean of its divisors is an integer number (19197000).
Almost surely, 21361066280 is an apocalyptic number.
1361066280 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 1361066280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2457216000).
1361066280 is an abundant number, since it is smaller than the sum of its proper divisors (3553365720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1361066280 is a wasteful number, since it uses less digits than its factorization.
1361066280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1056 (or 1052 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The square root of 1361066280 is about 36892.6317846803. The cubic root of 1361066280 is about 1108.2211260455.
The spelling of 1361066280 in words is "one billion, three hundred sixty-one million, sixty-six thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •