Base | Representation |
---|---|
bin | 1110100111111011111001… |
… | …0000110100111111111111 |
3 | 2002221011100220102021001002 |
4 | 3221332332100310333333 |
5 | 4101420303143440414 |
6 | 54110412502440515 |
7 | 3246454630425335 |
oct | 351767620647777 |
9 | 62834326367032 |
10 | 16079254671359 |
11 | 513a1a0093070 |
12 | 1978325a3313b |
13 | 8c836209c959 |
14 | 3d8350abdb55 |
15 | 1cd3d1c214de |
hex | e9fbe434fff |
16079254671359 has 8 divisors (see below), whose sum is σ = 17541888256128. Its totient is φ = 14616768279960.
The previous prime is 16079254671353. The next prime is 16079254671371. The reversal of 16079254671359 is 95317645297061.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16079254671359 - 240 = 14979743043583 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16079254671295 and 16079254671304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16079254671353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36569867 + ... + 37006940.
It is an arithmetic number, because the mean of its divisors is an integer number (2192736032016).
Almost surely, 216079254671359 is an apocalyptic number.
16079254671359 is a deficient number, since it is larger than the sum of its proper divisors (1462633584769).
16079254671359 is a wasteful number, since it uses less digits than its factorization.
16079254671359 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73596685.
The product of its (nonzero) digits is 85730400, while the sum is 65.
The spelling of 16079254671359 in words is "sixteen trillion, seventy-nine billion, two hundred fifty-four million, six hundred seventy-one thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •