Base | Representation |
---|---|
bin | 10111100001010111011… |
… | …011111000101001100101 |
3 | 12201112010221000220220120 |
4 | 113201113123320221211 |
5 | 202440313401143023 |
6 | 3234315141552153 |
7 | 224531161446042 |
oct | 27412733705145 |
9 | 5645127026816 |
10 | 1616374631013 |
11 | 57355638209a |
12 | 221320715659 |
13 | b95674aa70c |
14 | 583392dc1c9 |
15 | 2c0a3e2b8e3 |
hex | 178576f8a65 |
1616374631013 has 16 divisors (see below), whose sum is σ = 2164929822720. Its totient is φ = 1072701707184.
The previous prime is 1616374630957. The next prime is 1616374631021. The reversal of 1616374631013 is 3101364736161.
It is not a de Polignac number, because 1616374631013 - 214 = 1616374614629 is a prime.
It is a super-2 number, since 2×16163746310132 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1616374631063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19948620 + ... + 20029482.
It is an arithmetic number, because the mean of its divisors is an integer number (135308113920).
Almost surely, 21616374631013 is an apocalyptic number.
It is an amenable number.
1616374631013 is a deficient number, since it is larger than the sum of its proper divisors (548555191707).
1616374631013 is a wasteful number, since it uses less digits than its factorization.
1616374631013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110968.
The product of its (nonzero) digits is 163296, while the sum is 42.
The spelling of 1616374631013 in words is "one trillion, six hundred sixteen billion, three hundred seventy-four million, six hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •