Base | Representation |
---|---|
bin | 11111010110010101… |
… | …11010111111110110 |
3 | 1121102221101110012000 |
4 | 33223022322333312 |
5 | 233432041120432 |
6 | 11422022040130 |
7 | 1134034062615 |
oct | 175312727766 |
9 | 47387343160 |
10 | 16830410742 |
11 | 7157367772 |
12 | 3318579046 |
13 | 1782b26032 |
14 | b5937587c |
15 | 68787857c |
hex | 3eb2baff6 |
16830410742 has 96 divisors (see below), whose sum is σ = 38822061600. Its totient is φ = 5400805248.
The previous prime is 16830410711. The next prime is 16830410749. The reversal of 16830410742 is 24701403861.
It is a super-3 number, since 3×168304107423 (a number of 32 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16830410697 and 16830410706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16830410749) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 23737884 + ... + 23738592.
It is an arithmetic number, because the mean of its divisors is an integer number (404396475).
Almost surely, 216830410742 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16830410742, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19411030800).
16830410742 is an abundant number, since it is smaller than the sum of its proper divisors (21991650858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16830410742 is a wasteful number, since it uses less digits than its factorization.
16830410742 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 975 (or 860 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The spelling of 16830410742 in words is "sixteen billion, eight hundred thirty million, four hundred ten thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •