Base | Representation |
---|---|
bin | 11111000001100110100… |
… | …00000110111101000000 |
3 | 10202220120012011210011101 |
4 | 33200303100012331000 |
5 | 114431143002001313 |
6 | 2133415151224144 |
7 | 140005523241166 |
oct | 17406320067500 |
9 | 3686505153141 |
10 | 1066011750208 |
11 | 381102929959 |
12 | 152725218054 |
13 | 796a8376b72 |
14 | 398494c7236 |
15 | 1cae1b735dd |
hex | f833406f40 |
1066011750208 has 28 divisors (see below), whose sum is σ = 2172539154532. Its totient is φ = 518600309760.
The previous prime is 1066011750173. The next prime is 1066011750227. The reversal of 1066011750208 is 8020571106601.
It can be written as a sum of positive squares in 2 ways, for example, as 1033247854144 + 32763896064 = 1016488^2 + 181008^2 .
It is a super-2 number, since 2×10660117502082 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 225084573 + ... + 225089308.
Almost surely, 21066011750208 is an apocalyptic number.
It is an amenable number.
1066011750208 is an abundant number, since it is smaller than the sum of its proper divisors (1106527404324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066011750208 is an equidigital number, since it uses as much as digits as its factorization.
1066011750208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450173930 (or 450173920 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 37.
Adding to 1066011750208 its reverse (8020571106601), we get a palindrome (9086582856809).
The spelling of 1066011750208 in words is "one trillion, sixty-six billion, eleven million, seven hundred fifty thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •