Base | Representation |
---|---|
bin | 11111000010000010011… |
… | …10100111000100000000 |
3 | 10202221011112102000120121 |
4 | 33201001032213010000 |
5 | 114432133014112324 |
6 | 2133454325150024 |
7 | 140014401326341 |
oct | 17410116470400 |
9 | 3687145360517 |
10 | 1066246238464 |
11 | 381213228400 |
12 | 15278b85b314 |
13 | 79714b18004 |
14 | 3986c6c60c8 |
15 | 1cb075415e4 |
hex | f8413a7100 |
1066246238464 has 81 divisors (see below), whose sum is σ = 2339800056391. Its totient is φ = 484574773760.
The previous prime is 1066246238443. The next prime is 1066246238467. The reversal of 1066246238464 is 4648326426601.
The square root of 1066246238464 is 1032592.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×10662462384642 (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 (1066246238467) 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, 181733259 + ... + 181739125.
Almost surely, 21066246238464 is an apocalyptic number.
1066246238464 is the 1032592-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1066246238464
1066246238464 is an abundant number, since it is smaller than the sum of its proper divisors (1273553817927).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066246238464 is an frugal number, since it uses more digits than its factorization.
1066246238464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11772 (or 5880 counting only the distinct ones).
The product of its (nonzero) digits is 7962624, while the sum is 52.
The spelling of 1066246238464 in words is "one trillion, sixty-six billion, two hundred forty-six million, two hundred thirty-eight thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •