Base | Representation |
---|---|
bin | 1111000001000010100111… |
… | …0110111101111010100101 |
3 | 2011110101122002000101100010 |
4 | 3300100221312331322211 |
5 | 4131002104434423221 |
6 | 55040502303040433 |
7 | 3322563661126113 |
oct | 360205166757245 |
9 | 64411562011303 |
10 | 16510556561061 |
11 | 52960a68274a2 |
12 | 1a27a33ba0119 |
13 | 929c28720204 |
14 | 411188180ab3 |
15 | 1d97266a8c76 |
hex | f0429dbdea5 |
16510556561061 has 4 divisors (see below), whose sum is σ = 22014075414752. Its totient is φ = 11007037707372.
The previous prime is 16510556561027. The next prime is 16510556561069. The reversal of 16510556561061 is 16016565501561.
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 not a de Polignac number, because 16510556561061 - 215 = 16510556528293 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16510556561061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16510556561069) 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, 2751759426841 + ... + 2751759426846.
It is an arithmetic number, because the mean of its divisors is an integer number (5503518853688).
Almost surely, 216510556561061 is an apocalyptic number.
It is an amenable number.
16510556561061 is a deficient number, since it is larger than the sum of its proper divisors (5503518853691).
16510556561061 is an equidigital number, since it uses as much as digits as its factorization.
16510556561061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5503518853690.
The product of its (nonzero) digits is 810000, while the sum is 48.
The spelling of 16510556561061 in words is "sixteen trillion, five hundred ten billion, five hundred fifty-six million, five hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •