Base | Representation |
---|---|
bin | 11111100110000001… |
… | …11111110111010001 |
3 | 1121210010001020200210 |
4 | 33303000333313101 |
5 | 234214234330321 |
6 | 11443043034333 |
7 | 1140222564435 |
oct | 176300776721 |
9 | 47703036623 |
10 | 16962026961 |
11 | 7214692a00 |
12 | 335466b9a9 |
13 | 17a4189359 |
14 | b6ca369c5 |
15 | 6941c5b76 |
hex | 3f303fdd1 |
16962026961 has 48 divisors (see below), whose sum is σ = 25206713280. Its totient is φ = 10137072000.
The previous prime is 16962026951. The next prime is 16962027001.
16962026961 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 16962026961 - 218 = 16961764817 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 16962026961.
It is not an unprimeable number, because it can be changed into a prime (16962026951) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10741470 + ... + 10743048.
It is an arithmetic number, because the mean of its divisors is an integer number (525139860).
Almost surely, 216962026961 is an apocalyptic number.
16962026961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16962026961 is a deficient number, since it is larger than the sum of its proper divisors (8244686319).
16962026961 is a wasteful number, since it uses less digits than its factorization.
16962026961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1998 (or 1987 counting only the distinct ones).
The product of its (nonzero) digits is 419904, while the sum is 48.
The spelling of 16962026961 in words is "sixteen billion, nine hundred sixty-two million, twenty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •