Base | Representation |
---|---|
bin | 1111000011101001011011… |
… | …1000110001100000110011 |
3 | 2011121200012210100022110011 |
4 | 3300322112320301200303 |
5 | 4132220311332032201 |
6 | 55113225513315351 |
7 | 3326040434154064 |
oct | 360722670614063 |
9 | 64550183308404 |
10 | 16555335424051 |
11 | 5303095282a86 |
12 | 1a34650405b57 |
13 | 931213886248 |
14 | 4133d52c856b |
15 | 1da9979b5151 |
hex | f0e96e31833 |
16555335424051 has 4 divisors (see below), whose sum is σ = 16555639564152. Its totient is φ = 16555031283952.
The previous prime is 16555335424031. The next prime is 16555335424079. The reversal of 16555335424051 is 15042453355561.
16555335424051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 16555335424051 - 213 = 16555335415859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16555335423986 and 16555335424004.
It is not an unprimeable number, because it can be changed into a prime (16555335424031) 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, 151988386 + ... + 152097271.
It is an arithmetic number, because the mean of its divisors is an integer number (4138909891038).
Almost surely, 216555335424051 is an apocalyptic number.
16555335424051 is a deficient number, since it is larger than the sum of its proper divisors (304140101).
16555335424051 is an equidigital number, since it uses as much as digits as its factorization.
16555335424051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304140100.
The product of its (nonzero) digits is 5400000, while the sum is 49.
The spelling of 16555335424051 in words is "sixteen trillion, five hundred fifty-five billion, three hundred thirty-five million, four hundred twenty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •