Base | Representation |
---|---|
bin | 1100101100000110… |
… | …0110100000111110 |
3 | 22210101100121210010 |
4 | 3023001212200332 |
5 | 23433441213000 |
6 | 1321554324050 |
7 | 150260114640 |
oct | 31301464076 |
9 | 8711317703 |
10 | 3406194750 |
11 | 1498787592 |
12 | 7b0889626 |
13 | 4238b466a |
14 | 244540890 |
15 | 14e07cd50 |
hex | cb06683e |
3406194750 has 128 divisors (see below), whose sum is σ = 10030325760. Its totient is φ = 753408000.
The previous prime is 3406194707. The next prime is 3406194767. The reversal of 3406194750 is 574916043.
It is a junction number, because it is equal to n+sod(n) for n = 3406194699 and 3406194708.
It is a congruent number.
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, 152286 + ... + 173214.
It is an arithmetic number, because the mean of its divisors is an integer number (78361920).
Almost surely, 23406194750 is an apocalyptic number.
3406194750 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3406194750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5015162880).
3406194750 is an abundant number, since it is smaller than the sum of its proper divisors (6624131010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3406194750 is a wasteful number, since it uses less digits than its factorization.
3406194750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20987 (or 20977 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 39.
The square root of 3406194750 is about 58362.6143177291. The cubic root of 3406194750 is about 1504.6072786116.
The spelling of 3406194750 in words is "three billion, four hundred six million, one hundred ninety-four thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •