Base | Representation |
---|---|
bin | 111111001000000000000 |
3 | 10220002102101 |
4 | 13321000000 |
5 | 1012142410 |
6 | 112200144 |
7 | 23403361 |
oct | 7710000 |
9 | 3802371 |
10 | 2068480 |
11 | 1193097 |
12 | 839054 |
13 | 57566b |
14 | 3bbb68 |
15 | 2acd3a |
hex | 1f9000 |
2068480 has 52 divisors (see below), whose sum is σ = 5012892. Its totient is φ = 819200.
The previous prime is 2068477. The next prime is 2068487. The reversal of 2068480 is 848602.
It can be written as a sum of positive squares in 2 ways, for example, as 1478656 + 589824 = 1216^2 + 768^2 .
It is a nialpdrome in base 8.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2068487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20430 + ... + 20530.
22068480 is an apocalyptic number.
2068480 is a gapful number since it is divisible by the number (20) 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 2068480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2506446).
2068480 is an abundant number, since it is smaller than the sum of its proper divisors (2944412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2068480 is an equidigital number, since it uses as much as digits as its factorization.
2068480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130 (or 108 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
The square root of 2068480 is about 1438.2211234716. The cubic root of 2068480 is about 127.4139878686.
The spelling of 2068480 in words is "two million, sixty-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •