Base | Representation |
---|---|
bin | 11111100101011011… |
… | …01100110100100010 |
3 | 1121202202112020102020 |
4 | 33302231230310202 |
5 | 234211440440401 |
6 | 11442342402310 |
7 | 1140131565102 |
oct | 176255546442 |
9 | 47682466366 |
10 | 16956968226 |
11 | 7211848230 |
12 | 3352a30396 |
13 | 17a3107913 |
14 | b6c0bb202 |
15 | 693a26d36 |
hex | 3f2b6cd22 |
16956968226 has 128 divisors (see below), whose sum is σ = 38849642496. Its totient is φ = 4889417280.
The previous prime is 16956968221. The next prime is 16956968263. The reversal of 16956968226 is 62286965961.
It is a happy number.
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 16956968226.
It is not an unprimeable number, because it can be changed into a prime (16956968221) 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 63 ways as a sum of consecutive naturals, for example, 17249731 + ... + 17250713.
It is an arithmetic number, because the mean of its divisors is an integer number (303512832).
Almost surely, 216956968226 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16956968226, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19424821248).
16956968226 is an abundant number, since it is smaller than the sum of its proper divisors (21892674270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16956968226 is a wasteful number, since it uses less digits than its factorization.
16956968226 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1196.
The product of its digits is 16796160, while the sum is 60.
The spelling of 16956968226 in words is "sixteen billion, nine hundred fifty-six million, nine hundred sixty-eight thousand, two hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •