Base | Representation |
---|---|
bin | 11111100110100111… |
… | …11101111111110100 |
3 | 1121210110101220111100 |
4 | 33303103331333310 |
5 | 234222023000202 |
6 | 11443341410100 |
7 | 1140313056312 |
oct | 176323757764 |
9 | 47713356440 |
10 | 16967000052 |
11 | 721747a2a2 |
12 | 3356269930 |
13 | 17a520ab02 |
14 | b6d56d0b2 |
15 | 69485941c |
hex | 3f34fdff4 |
16967000052 has 36 divisors (see below), whose sum is σ = 42909526660. Its totient is φ = 5652934272.
The previous prime is 16967000041. The next prime is 16967000077. The reversal of 16967000052 is 25000076961.
It can be written as a sum of positive squares in 2 ways, for example, as 9292188816 + 7674811236 = 96396^2 + 87606^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-3 number, since 3×169670000523 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 16966999980 and 16967000016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 37603 + ... + 188010.
Almost surely, 216967000052 is an apocalyptic number.
16967000052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16967000052 is an abundant number, since it is smaller than the sum of its proper divisors (25942526608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16967000052 is a wasteful number, since it uses less digits than its factorization.
16967000052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227712 (or 227707 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The spelling of 16967000052 in words is "sixteen billion, nine hundred sixty-seven million, fifty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •