Base | Representation |
---|---|
bin | 11111100001110111… |
… | …11010110011011101 |
3 | 1121200200101212021022 |
4 | 33300323322303131 |
5 | 234131322003320 |
6 | 11435355213525 |
7 | 1136320216361 |
oct | 176073726335 |
9 | 47620355238 |
10 | 16927141085 |
11 | 71a6a256a8 |
12 | 3344a472a5 |
13 | 1799b9351a |
14 | b681552a1 |
15 | 6910d4325 |
hex | 3f0efacdd |
16927141085 has 8 divisors (see below), whose sum is σ = 20590824120. Its totient is φ = 13356209664.
The previous prime is 16927141081. The next prime is 16927141151. The reversal of 16927141085 is 58014172961.
It can be written as a sum of positive squares in 4 ways, for example, as 57547396 + 16869593689 = 7586^2 + 129883^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16927141085 - 22 = 16927141081 is a prime.
It is a super-2 number, since 2×169271410852 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16927141081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23187500 + ... + 23188229.
It is an arithmetic number, because the mean of its divisors is an integer number (2573853015).
Almost surely, 216927141085 is an apocalyptic number.
It is an amenable number.
16927141085 is a deficient number, since it is larger than the sum of its proper divisors (3663683035).
16927141085 is an equidigital number, since it uses as much as digits as its factorization.
16927141085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46375807.
The product of its (nonzero) digits is 120960, while the sum is 44.
The spelling of 16927141085 in words is "sixteen billion, nine hundred twenty-seven million, one hundred forty-one thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •