Base | Representation |
---|---|
bin | 1111000011101001000010… |
… | …1001000111011000111101 |
3 | 2011121122221111012112210020 |
4 | 3300322100221013120331 |
5 | 4132220103021443221 |
6 | 55113211252002353 |
7 | 3326035022513046 |
oct | 360722051073075 |
9 | 64548844175706 |
10 | 16555230656061 |
11 | 5303041125269 |
12 | 1a346213003b9 |
13 | 9311c7c63456 |
14 | 4133c54158cd |
15 | 1da98d6bcac6 |
hex | f0e90a4763d |
16555230656061 has 8 divisors (see below), whose sum is σ = 22074021313344. Its totient is φ = 11036630218080.
The previous prime is 16555230656053. The next prime is 16555230656071. The reversal of 16555230656061 is 16065603255561.
16555230656061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16555230656061 - 23 = 16555230656053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16555230655995 and 16555230656013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16555230656071) 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, 47351625 + ... + 47699966.
It is an arithmetic number, because the mean of its divisors is an integer number (2759252664168).
Almost surely, 216555230656061 is an apocalyptic number.
It is an amenable number.
16555230656061 is a deficient number, since it is larger than the sum of its proper divisors (5518790657283).
16555230656061 is an equidigital number, since it uses as much as digits as its factorization.
16555230656061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95109651.
The product of its (nonzero) digits is 4860000, while the sum is 51.
The spelling of 16555230656061 in words is "sixteen trillion, five hundred fifty-five billion, two hundred thirty million, six hundred fifty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •