Base | Representation |
---|---|
bin | 11110100111001001… |
… | …00111010100011110 |
3 | 1120102100101201201220 |
4 | 33103210213110132 |
5 | 232124212231302 |
6 | 11314440114210 |
7 | 1121155611615 |
oct | 172344472436 |
9 | 46370351656 |
10 | 16434492702 |
11 | 6a7392a681 |
12 | 3227a65966 |
13 | 171bab36c4 |
14 | b1c95487c |
15 | 662c1e4bc |
hex | 3d392751e |
16434492702 has 8 divisors (see below), whose sum is σ = 32868985416. Its totient is φ = 5478164232.
The previous prime is 16434492691. The next prime is 16434492707. The reversal of 16434492702 is 20729443461.
It is a sphenic number, since it is the product of 3 distinct primes.
16434492702 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16434492707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1369541053 + ... + 1369541064.
It is an arithmetic number, because the mean of its divisors is an integer number (4108623177).
Almost surely, 216434492702 is an apocalyptic number.
16434492702 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16434492702 is a wasteful number, since it uses less digits than its factorization.
16434492702 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2739082122.
The product of its (nonzero) digits is 290304, while the sum is 42.
The spelling of 16434492702 in words is "sixteen billion, four hundred thirty-four million, four hundred ninety-two thousand, seven hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •