Base | Representation |
---|---|
bin | 10011100111100010000… |
… | …11010000101101101001 |
3 | 2101102212100001012210221 |
4 | 21303301003100231221 |
5 | 42020433104441441 |
6 | 1233354121010041 |
7 | 66461545331014 |
oct | 11636103205551 |
9 | 2342770035727 |
10 | 674059062121 |
11 | 23a95984a065 |
12 | aa779023921 |
13 | 4b743005663 |
14 | 248a5dc637b |
15 | 128019bd8d1 |
hex | 9cf10d0b69 |
674059062121 has 9 divisors (see below), whose sum is σ = 680506242871. Its totient is φ = 667672417552.
The previous prime is 674059062113. The next prime is 674059062151. The reversal of 674059062121 is 121260950476.
The square root of 674059062121 is 821011.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 426715965225 + 247343096896 = 653235^2 + 497336^2 .
It is not a de Polignac number, because 674059062121 - 23 = 674059062113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (674059062151) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 87844341 + ... + 87852013.
Almost surely, 2674059062121 is an apocalyptic number.
674059062121 is the 821011-st square number.
674059062121 is the 410506-th centered octagonal number.
It is an amenable number.
674059062121 is a deficient number, since it is larger than the sum of its proper divisors (6447180750).
674059062121 is an frugal number, since it uses more digits than its factorization.
674059062121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15560 (or 7780 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 43.
The spelling of 674059062121 in words is "six hundred seventy-four billion, fifty-nine million, sixty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •