Base | Representation |
---|---|
bin | 10011101010111101111… |
… | …00000100001101111001 |
3 | 2101121121211010011221201 |
4 | 21311132330010031321 |
5 | 42033222040412224 |
6 | 1234301055534201 |
7 | 66555332620132 |
oct | 11653674041571 |
9 | 2347554104851 |
10 | 675902669689 |
11 | 240715488785 |
12 | aabb252a361 |
13 | 4b977c53300 |
14 | 249dcbb0c89 |
15 | 128ad78ca44 |
hex | 9d5ef04379 |
675902669689 has 9 divisors (see below), whose sum is σ = 731906180109. Its totient is φ = 623900291040.
The previous prime is 675902669657. The next prime is 675902669711. The reversal of 675902669689 is 986966209576.
The square root of 675902669689 is 822133.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 215551275625 + 460351394064 = 464275^2 + 678492^2 .
It is not a de Polignac number, because 675902669689 - 25 = 675902669657 is a prime.
It is not an unprimeable number, because it can be changed into a prime (675902669789) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 10656109 + ... + 10719349.
It is an arithmetic number, because the mean of its divisors is an integer number (81322908901).
Almost surely, 2675902669689 is an apocalyptic number.
675902669689 is the 822133-rd square number.
675902669689 is the 411067-th centered octagonal number.
It is an amenable number.
675902669689 is a deficient number, since it is larger than the sum of its proper divisors (56003510420).
675902669689 is an frugal number, since it uses more digits than its factorization.
675902669689 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126508 (or 63254 counting only the distinct ones).
The product of its (nonzero) digits is 529079040, while the sum is 73.
The spelling of 675902669689 in words is "six hundred seventy-five billion, nine hundred two million, six hundred sixty-nine thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •