Base | Representation |
---|---|
bin | 1110100110100101011101… |
… | …0010000100010101000111 |
3 | 2002211221110212200211210112 |
4 | 3221221113102010111013 |
5 | 4101030243314402232 |
6 | 54052014251143235 |
7 | 3245003640040004 |
oct | 351512722042507 |
9 | 62757425624715 |
10 | 16056052106567 |
11 | 5130373919790 |
12 | 197392b444b1b |
13 | 8c6105068c85 |
14 | 3d718d3428ab |
15 | 1cc9c4c4c4b2 |
hex | e9a57484547 |
16056052106567 has 8 divisors (see below), whose sum is σ = 17554020768912. Its totient is φ = 14564471371200.
The previous prime is 16056052106533. The next prime is 16056052106573. The reversal of 16056052106567 is 76560125065061.
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 16056052106567 - 210 = 16056052105543 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16056052106267) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1596976484 + ... + 1596986537.
It is an arithmetic number, because the mean of its divisors is an integer number (2194252596114).
Almost surely, 216056052106567 is an apocalyptic number.
16056052106567 is a deficient number, since it is larger than the sum of its proper divisors (1497968662345).
16056052106567 is a wasteful number, since it uses less digits than its factorization.
16056052106567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3193963489.
The product of its (nonzero) digits is 2268000, while the sum is 50.
The spelling of 16056052106567 in words is "sixteen trillion, fifty-six billion, fifty-two million, one hundred six thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •