Base | Representation |
---|---|
bin | 1111000000101011001000… |
… | …1100110110111010001001 |
3 | 2011102210100211202110212201 |
4 | 3300022302030312322021 |
5 | 4130401203020110223 |
6 | 55033541042440201 |
7 | 3322251541610626 |
oct | 360126214667211 |
9 | 64383324673781 |
10 | 16504254066313 |
11 | 5293462178952 |
12 | 1a26775363061 |
13 | 929462a91c90 |
14 | 410b4b10d34d |
15 | 1d94a821cead |
hex | f02b2336e89 |
16504254066313 has 16 divisors (see below), whose sum is σ = 18819516134160. Its totient is φ = 14338395979776.
The previous prime is 16504254066259. The next prime is 16504254066343. The reversal of 16504254066313 is 31366045240561.
It can be written as a sum of positive squares in 8 ways, for example, as 5448176861689 + 11056077204624 = 2334133^2 + 3325068^2 .
It is a cyclic number.
It is not a de Polignac number, because 16504254066313 - 225 = 16504220511881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16504254066343) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26501481 + ... + 27117097.
It is an arithmetic number, because the mean of its divisors is an integer number (1176219758385).
Almost surely, 216504254066313 is an apocalyptic number.
16504254066313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
16504254066313 is a deficient number, since it is larger than the sum of its proper divisors (2315262067847).
16504254066313 is a wasteful number, since it uses less digits than its factorization.
16504254066313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 736956.
The product of its (nonzero) digits is 1555200, while the sum is 46.
The spelling of 16504254066313 in words is "sixteen trillion, five hundred four billion, two hundred fifty-four million, sixty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •