Base | Representation |
---|---|
bin | 1111000011101001001011… |
… | …0001101100101010101011 |
3 | 2011121200000222120121000022 |
4 | 3300322102301230222223 |
5 | 4132220141203212311 |
6 | 55113215011231055 |
7 | 3326035636034504 |
oct | 360722261545253 |
9 | 64550028517008 |
10 | 16555266460331 |
11 | 530305a35a575 |
12 | 1a346312a848b |
13 | 9312024bb301 |
14 | 4133ca095bab |
15 | 1da9918e15db |
hex | f0e92c6caab |
16555266460331 has 8 divisors (see below), whose sum is σ = 17003624821344. Its totient is φ = 16106956453440.
The previous prime is 16555266460301. The next prime is 16555266460387. The reversal of 16555266460331 is 13306466255561.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16555266460331 is a prime.
It is a super-2 number, since 2×165552664603312 (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 (16555266460301) 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 7 ways as a sum of consecutive naturals, for example, 11393975 + ... + 12764528.
It is an arithmetic number, because the mean of its divisors is an integer number (2125453102668).
Almost surely, 216555266460331 is an apocalyptic number.
16555266460331 is a deficient number, since it is larger than the sum of its proper divisors (448358361013).
16555266460331 is a wasteful number, since it uses less digits than its factorization.
16555266460331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24177061.
The product of its (nonzero) digits is 11664000, while the sum is 53.
The spelling of 16555266460331 in words is "sixteen trillion, five hundred fifty-five billion, two hundred sixty-six million, four hundred sixty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •