Base | Representation |
---|---|
bin | 11110010110010110… |
… | …11011000111001001 |
3 | 1120001112102021011222 |
4 | 33023023123013021 |
5 | 231332134440434 |
6 | 11252445531425 |
7 | 1114525631033 |
oct | 171313330711 |
9 | 46045367158 |
10 | 16293671369 |
11 | 6a01397508 |
12 | 31a8873b75 |
13 | 16c8879581 |
14 | b07d78c53 |
15 | 6556a472e |
hex | 3cb2db1c9 |
16293671369 has 16 divisors (see below), whose sum is σ = 18180391680. Its totient is φ = 14511893760.
The previous prime is 16293671311. The next prime is 16293671399. The reversal of 16293671369 is 96317639261.
It is a cyclic number.
It is not a de Polignac number, because 16293671369 - 28 = 16293671113 is a prime.
It is a super-2 number, since 2×162936713692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16293671369.
It is not an unprimeable number, because it can be changed into a prime (16293671399) 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 15 ways as a sum of consecutive naturals, for example, 266567 + ... + 321939.
It is an arithmetic number, because the mean of its divisors is an integer number (1136274480).
Almost surely, 216293671369 is an apocalyptic number.
16293671369 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
16293671369 is a deficient number, since it is larger than the sum of its proper divisors (1886720311).
16293671369 is a wasteful number, since it uses less digits than its factorization.
16293671369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56320.
The product of its digits is 2204496, while the sum is 53.
The spelling of 16293671369 in words is "sixteen billion, two hundred ninety-three million, six hundred seventy-one thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •