Base | Representation |
---|---|
bin | 11111000101110001… |
… | …00001010001100010 |
3 | 1121002020202101212000 |
4 | 33202320201101202 |
5 | 233140442302213 |
6 | 11400133544430 |
7 | 1130425203360 |
oct | 174270412142 |
9 | 47066671760 |
10 | 16691369058 |
11 | 709592a691 |
12 | 3299aa5116 |
13 | 1760092c50 |
14 | b44b00630 |
15 | 67a560c73 |
hex | 3e2e21462 |
16691369058 has 64 divisors (see below), whose sum is σ = 45651621120. Its totient is φ = 4402118016.
The previous prime is 16691369053. The next prime is 16691369059. The reversal of 16691369058 is 85096319661.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 16691368995 and 16691369013.
It is not an unprimeable number, because it can be changed into a prime (16691369053) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1693435 + ... + 1703262.
It is an arithmetic number, because the mean of its divisors is an integer number (713306580).
Almost surely, 216691369058 is an apocalyptic number.
16691369058 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
16691369058 is an abundant number, since it is smaller than the sum of its proper divisors (28960252062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16691369058 is a wasteful number, since it uses less digits than its factorization.
16691369058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3396728 (or 3396722 counting only the distinct ones).
The product of its (nonzero) digits is 2099520, while the sum is 54.
The spelling of 16691369058 in words is "sixteen billion, six hundred ninety-one million, three hundred sixty-nine thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •