Base | Representation |
---|---|
bin | 111101110011001… |
… | …0001101011000100 |
3 | 12100111220101120000 |
4 | 1323212101223010 |
5 | 13221322201203 |
6 | 541433041300 |
7 | 102246401451 |
oct | 17346215304 |
9 | 5314811500 |
10 | 2073631428 |
11 | 974568a90 |
12 | 49a556230 |
13 | 2707b7a5b |
14 | 159584828 |
15 | c20a94a3 |
hex | 7b991ac4 |
2073631428 has 120 divisors (see below), whose sum is σ = 6117914880. Its totient is φ = 606674880.
The previous prime is 2073631409. The next prime is 2073631451. The reversal of 2073631428 is 8241363702.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 2073631392 and 2073631401.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 93325 + ... + 113387.
It is an arithmetic number, because the mean of its divisors is an integer number (50982624).
Almost surely, 22073631428 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2073631428, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3058957440).
2073631428 is an abundant number, since it is smaller than the sum of its proper divisors (4044283452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2073631428 is a wasteful number, since it uses less digits than its factorization.
2073631428 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20119 (or 20108 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 2073631428 is about 45537.1433886668. The cubic root of 2073631428 is about 1275.1967253542.
The spelling of 2073631428 in words is "two billion, seventy-three million, six hundred thirty-one thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •