Base | Representation |
---|---|
bin | 1110100111100011101111… |
… | …0111101001011111101101 |
3 | 2002220112122010020202020221 |
4 | 3221320323313221133231 |
5 | 4101314014122042021 |
6 | 54103421330011341 |
7 | 3246135163246162 |
oct | 351707367513755 |
9 | 62815563222227 |
10 | 16072772065261 |
11 | 51374738a616a |
12 | 1977016a16b51 |
13 | 8c786b02bc62 |
14 | 3d7cd7b66069 |
15 | 1cd152a59241 |
hex | e9e3bde97ed |
16072772065261 has 4 divisors (see below), whose sum is σ = 16075816732800. Its totient is φ = 16069727397724.
The previous prime is 16072772065249. The next prime is 16072772065277. The reversal of 16072772065261 is 16256027727061.
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 a cyclic number.
It is not a de Polignac number, because 16072772065261 - 217 = 16072771934189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16072772065199 and 16072772065208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16072772035261) 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, 1522325851 + ... + 1522336408.
It is an arithmetic number, because the mean of its divisors is an integer number (4018954183200).
Almost surely, 216072772065261 is an apocalyptic number.
It is an amenable number.
16072772065261 is a deficient number, since it is larger than the sum of its proper divisors (3044667539).
16072772065261 is an equidigital number, since it uses as much as digits as its factorization.
16072772065261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3044667538.
The product of its (nonzero) digits is 2963520, while the sum is 52.
The spelling of 16072772065261 in words is "sixteen trillion, seventy-two billion, seven hundred seventy-two million, sixty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •