Base | Representation |
---|---|
bin | 11000100101001000111… |
… | …110000011000110010100 |
3 | 12222110222111220102022021 |
4 | 120211020332003012110 |
5 | 210133332432410000 |
6 | 3331552204542524 |
7 | 233015423160466 |
oct | 30451076030624 |
9 | 5873874812267 |
10 | 1689146372500 |
11 | 5a13aa100604 |
12 | 23344b851a44 |
13 | c3393c39b92 |
14 | 5ba800a0136 |
15 | 2de12a4411a |
hex | 18948f83194 |
1689146372500 has 30 divisors (see below), whose sum is σ = 3693825292850. Its totient is φ = 675658548000.
The previous prime is 1689146372489. The next prime is 1689146372519. The reversal of 1689146372500 is 52736419861.
It can be written as a sum of positive squares in 5 ways, for example, as 137716694404 + 1551429678096 = 371102^2 + 1245564^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 337826775 + ... + 337831774.
It is a 1-persistent number, because it is pandigital, but 2⋅1689146372500 = 3378292745000 is not.
Almost surely, 21689146372500 is an apocalyptic number.
1689146372500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1689146372500 is an abundant number, since it is smaller than the sum of its proper divisors (2004678920350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1689146372500 is an equidigital number, since it uses as much as digits as its factorization.
1689146372500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675658573 (or 675658556 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 52.
The spelling of 1689146372500 in words is "one trillion, six hundred eighty-nine billion, one hundred forty-six million, three hundred seventy-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •