Base | Representation |
---|---|
bin | 1110110010100010001100… |
… | …1011101110110100010011 |
3 | 2010120120100111102112012121 |
4 | 3230220203023232310103 |
5 | 4112411204113214223 |
6 | 54330204351235111 |
7 | 3265562035204615 |
oct | 354504313566423 |
9 | 63516314375177 |
10 | 16261336460563 |
11 | 51aa437555297 |
12 | 19a7680818a97 |
13 | 90c58c0c711c |
14 | 4030a5184db5 |
15 | 1d2edc09615d |
hex | eca232eed13 |
16261336460563 has 4 divisors (see below), whose sum is σ = 16261354978560. Its totient is φ = 16261317942568.
The previous prime is 16261336460543. The next prime is 16261336460581. The reversal of 16261336460563 is 36506463316261.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 16261336460563 - 213 = 16261336452371 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 16261336460563.
It is not an unprimeable number, because it can be changed into a prime (16261336460513) 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 3 ways as a sum of consecutive naturals, for example, 7872595 + ... + 9721132.
It is an arithmetic number, because the mean of its divisors is an integer number (4065338744640).
Almost surely, 216261336460563 is an apocalyptic number.
16261336460563 is a deficient number, since it is larger than the sum of its proper divisors (18517997).
16261336460563 is an equidigital number, since it uses as much as digits as its factorization.
16261336460563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18517996.
The product of its (nonzero) digits is 8398080, while the sum is 52.
The spelling of 16261336460563 in words is "sixteen trillion, two hundred sixty-one billion, three hundred thirty-six million, four hundred sixty thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •