Base | Representation |
---|---|
bin | 11110110110011110… |
… | …00110110000001101 |
3 | 1120202022100020101121 |
4 | 33123033012300031 |
5 | 232410121301023 |
6 | 11335312040541 |
7 | 1124306534455 |
oct | 173317066015 |
9 | 46668306347 |
10 | 16563072013 |
11 | 702a471174 |
12 | 3262b33151 |
13 | 173c622637 |
14 | b31a64d65 |
15 | 66e16bd5d |
hex | 3db3c6c0d |
16563072013 has 4 divisors (see below), whose sum is σ = 16563361948. Its totient is φ = 16562782080.
The previous prime is 16563072011. The next prime is 16563072049. The reversal of 16563072013 is 31027036561.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11663352009 + 4899720004 = 107997^2 + 69998^2 .
It is a cyclic number.
It is not a de Polignac number, because 16563072013 - 21 = 16563072011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16563072013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16563072011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27606 + ... + 184087.
It is an arithmetic number, because the mean of its divisors is an integer number (4140840487).
Almost surely, 216563072013 is an apocalyptic number.
It is an amenable number.
16563072013 is a deficient number, since it is larger than the sum of its proper divisors (289935).
16563072013 is an equidigital number, since it uses as much as digits as its factorization.
16563072013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289934.
The product of its (nonzero) digits is 22680, while the sum is 34.
The spelling of 16563072013 in words is "sixteen billion, five hundred sixty-three million, seventy-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •