Base | Representation |
---|---|
bin | 1110100111100011100110… |
… | …0101011001100101010101 |
3 | 2002220112112110002222010121 |
4 | 3221320321211121211111 |
5 | 4101313424313231221 |
6 | 54103413440151541 |
7 | 3246134216342044 |
oct | 351707145314525 |
9 | 62815473088117 |
10 | 16072733727061 |
11 | 51374541a0100 |
12 | 19770060085b1 |
13 | 8c78630c792b |
14 | 3d7cd2a2655b |
15 | 1cd14e4d4a41 |
hex | e9e39959955 |
16072733727061 has 24 divisors (see below), whose sum is σ = 17902209427200. Its totient is φ = 14417058770400.
The previous prime is 16072733727053. The next prime is 16072733727077.
16072733727061 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 16072733727061 - 23 = 16072733727053 is a prime.
It is a super-2 number, since 2×160727337270612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16072733721061) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13887255 + ... + 15000043.
It is an arithmetic number, because the mean of its divisors is an integer number (745925392800).
Almost surely, 216072733727061 is an apocalyptic number.
16072733727061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16072733727061 is a deficient number, since it is larger than the sum of its proper divisors (1829475700139).
16072733727061 is a wasteful number, since it uses less digits than its factorization.
16072733727061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1114401 (or 1114390 counting only the distinct ones).
The product of its (nonzero) digits is 3111696, while the sum is 52.
The spelling of 16072733727061 in words is "sixteen trillion, seventy-two billion, seven hundred thirty-three million, seven hundred twenty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •