Base | Representation |
---|---|
bin | 10011101011010100001… |
… | …10101001010100110100 |
3 | 2101122002212121011112121 |
4 | 21311222012221110310 |
5 | 42034113014230000 |
6 | 1234331430525324 |
7 | 66563066054566 |
oct | 11655206512464 |
9 | 2348085534477 |
10 | 676089992500 |
11 | 2408011a211a |
12 | ab045206844 |
13 | 4b9a79bc300 |
14 | 24a19a13336 |
15 | 128bee40b1a |
hex | 9d6a1a9534 |
676089992500 has 360 divisors, whose sum is σ = 1673531142360. Its totient is φ = 238567680000.
The previous prime is 676089992437. The next prime is 676089992521. The reversal of 676089992500 is 5299980676.
It can be written as a sum of positive squares in 60 ways, for example, as 33209959696 + 642880032804 = 182236^2 + 801798^2 .
It is a Harshad number since it is a multiple of its sum of digits (61).
It is a congruent number.
It is an unprimeable number.
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 119 ways as a sum of consecutive naturals, for example, 953582146 + ... + 953582854.
Almost surely, 2676089992500 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 676089992500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (836765571180).
676089992500 is an abundant number, since it is smaller than the sum of its proper divisors (997441149860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
676089992500 is a wasteful number, since it uses less digits than its factorization.
676089992500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857 (or 827 counting only the distinct ones).
The product of its (nonzero) digits is 14696640, while the sum is 61.
The spelling of 676089992500 in words is "six hundred seventy-six billion, eighty-nine million, nine hundred ninety-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •