Base | Representation |
---|---|
bin | 1111000000101110110111… |
… | …0101001101101011111001 |
3 | 2011102212221120020211102110 |
4 | 3300023231311031223321 |
5 | 4130410230123013423 |
6 | 55034224221322533 |
7 | 3322315410302310 |
oct | 360135565155371 |
9 | 64385846224373 |
10 | 16505254501113 |
11 | 5293925969374 |
12 | 1a269b4406449 |
13 | 929592122031 |
14 | 410c03d31277 |
15 | 1d9515e88193 |
hex | f02edd4daf9 |
16505254501113 has 8 divisors (see below), whose sum is σ = 25150864001728. Its totient is φ = 9431574000624.
The previous prime is 16505254501079. The next prime is 16505254501117. The reversal of 16505254501113 is 31110545250561.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16505254501113 - 226 = 16505187392249 is a prime.
It is a super-2 number, since 2×165052545011132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (16505254501117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 392982250006 + ... + 392982250047.
It is an arithmetic number, because the mean of its divisors is an integer number (3143858000216).
Almost surely, 216505254501113 is an apocalyptic number.
It is an amenable number.
16505254501113 is a deficient number, since it is larger than the sum of its proper divisors (8645609500615).
16505254501113 is an equidigital number, since it uses as much as digits as its factorization.
16505254501113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 785964500063.
The product of its (nonzero) digits is 90000, while the sum is 39.
Adding to 16505254501113 its reverse (31110545250561), we get a palindrome (47615799751674).
The spelling of 16505254501113 in words is "sixteen trillion, five hundred five billion, two hundred fifty-four million, five hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •