Base | Representation |
---|---|
bin | 11110010111101111… |
… | …00101111101110001 |
3 | 1120002100012112022010 |
4 | 33023313211331301 |
5 | 231343121001121 |
6 | 11253542033133 |
7 | 1115026224324 |
oct | 171367457561 |
9 | 46070175263 |
10 | 16305250161 |
11 | 6a07985862 |
12 | 31b07187a9 |
13 | 16cb0a1925 |
14 | b097107bb |
15 | 6566e0376 |
hex | 3cbde5f71 |
16305250161 has 4 divisors (see below), whose sum is σ = 21740333552. Its totient is φ = 10870166772.
The previous prime is 16305250153. The next prime is 16305250177. The reversal of 16305250161 is 16105250361.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 16305250161 - 23 = 16305250153 is a prime.
It is a super-2 number, since 2×163052501612 (a number of 21 digits) contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16305250111) 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, 2717541691 + ... + 2717541696.
It is an arithmetic number, because the mean of its divisors is an integer number (5435083388).
Almost surely, 216305250161 is an apocalyptic number.
It is an amenable number.
16305250161 is a deficient number, since it is larger than the sum of its proper divisors (5435083391).
16305250161 is an equidigital number, since it uses as much as digits as its factorization.
16305250161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5435083390.
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 16305250161 in words is "sixteen billion, three hundred five million, two hundred fifty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •