Base | Representation |
---|---|
bin | 101000010011100… |
… | …001001111011011 |
3 | 1202010101210121022 |
4 | 220103201033123 |
5 | 2341102034111 |
6 | 151033233055 |
7 | 22520436461 |
oct | 5023411733 |
9 | 1663353538 |
10 | 676205531 |
11 | 317778251 |
12 | 16a56278b |
13 | aa12ab21 |
14 | 65b42831 |
15 | 3e5722db |
hex | 284e13db |
676205531 has 4 divisors (see below), whose sum is σ = 681530112. Its totient is φ = 670880952.
The previous prime is 676205521. The next prime is 676205561. The reversal of 676205531 is 135502676.
676205531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-676205531 is a prime.
It is a super-2 number, since 2×6762055312 = 914507840309983922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 676205491 and 676205500.
It is not an unprimeable number, because it can be changed into a prime (676205501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2662100 + ... + 2662353.
It is an arithmetic number, because the mean of its divisors is an integer number (170382528).
Almost surely, 2676205531 is an apocalyptic number.
676205531 is a deficient number, since it is larger than the sum of its proper divisors (5324581).
676205531 is a wasteful number, since it uses less digits than its factorization.
676205531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5324580.
The product of its (nonzero) digits is 37800, while the sum is 35.
The square root of 676205531 is about 26003.9522188455. The cubic root of 676205531 is about 877.7272322186.
The spelling of 676205531 in words is "six hundred seventy-six million, two hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •