Base | Representation |
---|---|
bin | 11110010110001110… |
… | …11100101100001101 |
3 | 1120001110110022200101 |
4 | 33023013130230031 |
5 | 231331403114021 |
6 | 11252411331101 |
7 | 1114514030566 |
oct | 171307345415 |
9 | 46043408611 |
10 | 16292629261 |
11 | 6a00845567 |
12 | 31a8450a91 |
13 | 16c85a313c |
14 | b07b8716d |
15 | 65554aa91 |
hex | 3cb1dcb0d |
16292629261 has 4 divisors (see below), whose sum is σ = 16453942524. Its totient is φ = 16131316000.
The previous prime is 16292629253. The next prime is 16292629273.
16292629261 is nontrivially palindromic in base 10.
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 14545807236 + 1746822025 = 120606^2 + 41795^2 .
It is not a de Polignac number, because 16292629261 - 23 = 16292629253 is a prime.
It is a super-2 number, since 2×162926292612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16292629231) 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, 80656480 + ... + 80656681.
It is an arithmetic number, because the mean of its divisors is an integer number (4113485631).
Almost surely, 216292629261 is an apocalyptic number.
It is an amenable number.
16292629261 is a deficient number, since it is larger than the sum of its proper divisors (161313263).
16292629261 is a wasteful number, since it uses less digits than its factorization.
16292629261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161313262.
The product of its digits is 279936, while the sum is 46.
The spelling of 16292629261 in words is "sixteen billion, two hundred ninety-two million, six hundred twenty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •