Base | Representation |
---|---|
bin | 1110111101001000101010… |
… | …1100001010011100101011 |
3 | 2011012222110010002100100212 |
4 | 3233102022230022130223 |
5 | 4123402202140021102 |
6 | 54550004430051335 |
7 | 3315000210541220 |
oct | 357221254123453 |
9 | 64188403070325 |
10 | 16443461642027 |
11 | 526a6a6464792 |
12 | 1a16a2a049b4b |
13 | 9237c51051a4 |
14 | 40bc21303947 |
15 | 1d7aeb13cc52 |
hex | ef48ab0a72b |
16443461642027 has 32 divisors (see below), whose sum is σ = 20540475408384. Its totient is φ = 12837003379200.
The previous prime is 16443461641991. The next prime is 16443461642053. The reversal of 16443461642027 is 72024616434461.
It is not a de Polignac number, because 16443461642027 - 28 = 16443461641771 is a prime.
It is a super-3 number, since 3×164434616420273 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16443461642527) 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 31 ways as a sum of consecutive naturals, for example, 191309153 + ... + 191395085.
It is an arithmetic number, because the mean of its divisors is an integer number (641889856512).
Almost surely, 216443461642027 is an apocalyptic number.
16443461642027 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
16443461642027 is a deficient number, since it is larger than the sum of its proper divisors (4097013766357).
16443461642027 is a wasteful number, since it uses less digits than its factorization.
16443461642027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137859.
The product of its (nonzero) digits is 4644864, while the sum is 50.
The spelling of 16443461642027 in words is "sixteen trillion, four hundred forty-three billion, four hundred sixty-one million, six hundred forty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •