Base | Representation |
---|---|
bin | 1111000011101001011011… |
… | …0101011100101100111001 |
3 | 2011121200012201201000201221 |
4 | 3300322112311130230321 |
5 | 4132220311121134002 |
6 | 55113225442512041 |
7 | 3326040423563545 |
oct | 360722665345471 |
9 | 64550181630657 |
10 | 16555334552377 |
11 | 5303094838095 |
12 | 1a34650065621 |
13 | 93121363c56a |
14 | 4133d513ca25 |
15 | 1da997891c37 |
hex | f0e96d5cb39 |
16555334552377 has 4 divisors (see below), whose sum is σ = 16560732447376. Its totient is φ = 16549936657380.
The previous prime is 16555334552357. The next prime is 16555334552381. The reversal of 16555334552377 is 77325543355561.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 16555334552377 - 223 = 16555326163769 is a prime.
It is a super-2 number, since 2×165553345523772 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16555334552357) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2698942899 + ... + 2698949032.
It is an arithmetic number, because the mean of its divisors is an integer number (4140183111844).
Almost surely, 216555334552377 is an apocalyptic number.
It is an amenable number.
16555334552377 is a deficient number, since it is larger than the sum of its proper divisors (5397894999).
16555334552377 is an equidigital number, since it uses as much as digits as its factorization.
16555334552377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5397894998.
The product of its digits is 198450000, while the sum is 61.
The spelling of 16555334552377 in words is "sixteen trillion, five hundred fifty-five billion, three hundred thirty-four million, five hundred fifty-two thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •