Base | Representation |
---|---|
bin | 111100111000000… |
… | …1100100011010100 |
3 | 12021100122202200202 |
4 | 1321300030203110 |
5 | 13140411134320 |
6 | 534405400032 |
7 | 101422320605 |
oct | 17160144324 |
9 | 5240582622 |
10 | 2042677460 |
11 | 95904689a |
12 | 490109018 |
13 | 26726a7b5 |
14 | 155407dac |
15 | be4e2b75 |
hex | 79c0c8d4 |
2042677460 has 48 divisors (see below), whose sum is σ = 4559318400. Its totient is φ = 766537344.
The previous prime is 2042677423. The next prime is 2042677471. The reversal of 2042677460 is 647762402.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a congruent number.
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, 13046 + ... + 65234.
It is an arithmetic number, because the mean of its divisors is an integer number (94985800).
Almost surely, 22042677460 is an apocalyptic number.
2042677460 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 2042677460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2279659200).
2042677460 is an abundant number, since it is smaller than the sum of its proper divisors (2516640940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2042677460 is a wasteful number, since it uses less digits than its factorization.
2042677460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52320 (or 52318 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 38.
The square root of 2042677460 is about 45195.9894238416. The cubic root of 2042677460 is about 1268.8197562171.
The spelling of 2042677460 in words is "two billion, forty-two million, six hundred seventy-seven thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •