Base | Representation |
---|---|
bin | 1110101001010110011010… |
… | …0101100101001010000101 |
3 | 2010000111002022222200100211 |
4 | 3222111212211211022011 |
5 | 4102320034200122021 |
6 | 54125511555235421 |
7 | 3251305032302404 |
oct | 352254645451205 |
9 | 63014068880324 |
10 | 16103553520261 |
11 | 514952a163979 |
12 | 1980b875a8b71 |
13 | 8ca735282b5c |
14 | 3d95b7cad63b |
15 | 1cdd550953e1 |
hex | ea566965285 |
16103553520261 has 4 divisors (see below), whose sum is σ = 17050821374412. Its totient is φ = 15156285666112.
The previous prime is 16103553520247. The next prime is 16103553520273. The reversal of 16103553520261 is 16202535530161.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14707301700100 + 1396251820161 = 3835010^2 + 1181631^2 .
It is a cyclic number.
It is not a de Polignac number, because 16103553520261 - 237 = 15966114566789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16103553520211) 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, 473633927050 + ... + 473633927083.
It is an arithmetic number, because the mean of its divisors is an integer number (4262705343603).
Almost surely, 216103553520261 is an apocalyptic number.
It is an amenable number.
16103553520261 is a deficient number, since it is larger than the sum of its proper divisors (947267854151).
16103553520261 is an equidigital number, since it uses as much as digits as its factorization.
16103553520261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947267854150.
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 16103553520261 in words is "sixteen trillion, one hundred three billion, five hundred fifty-three million, five hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •