Base | Representation |
---|---|
bin | 11111000001000000111… |
… | …11010100011000100100 |
3 | 10202212202020212022021101 |
4 | 33200200133110120210 |
5 | 114430021411022101 |
6 | 2133324024325444 |
7 | 136664651533351 |
oct | 17404037243044 |
9 | 3685666768241 |
10 | 1065696970276 |
11 | 380a61180054 |
12 | 152657913884 |
13 | 796580a2953 |
14 | 39819787628 |
15 | 1cac41e5401 |
hex | f8207d4624 |
1065696970276 has 9 divisors (see below), whose sum is σ = 1864973311131. Its totient is φ = 532847452812.
The previous prime is 1065696970231. The next prime is 1065696970277. The reversal of 1065696970276 is 6720796965601.
The square root of 1065696970276 is 1032326.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×10656969702762 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1065696970277) by changing a digit.
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 2 ways as a sum of consecutive naturals, for example, 1806571 + ... + 2322733.
Almost surely, 21065696970276 is an apocalyptic number.
1065696970276 is the 1032326-th square number.
It is an amenable number.
1065696970276 is a deficient number, since it is larger than the sum of its proper divisors (799276340855).
1065696970276 is an frugal number, since it uses more digits than its factorization.
1065696970276 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1032330 (or 516165 counting only the distinct ones).
The product of its (nonzero) digits is 51438240, while the sum is 64.
Multiplying 1065696970276 by its sum of digits (64), we get a square (68204606097664 = 82586082).
The spelling of 1065696970276 in words is "one trillion, sixty-five billion, six hundred ninety-six million, nine hundred seventy thousand, two hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •