Base | Representation |
---|---|
bin | 111111100011000… |
… | …100000001000101 |
3 | 2202022011100020000 |
4 | 333203010001011 |
5 | 4140413443401 |
6 | 253443231513 |
7 | 35264114553 |
oct | 7743040105 |
9 | 2668140200 |
10 | 1066156101 |
11 | 4a78a994a |
12 | 259078599 |
13 | 13cb611ca |
14 | a184cbd3 |
15 | 638ed186 |
hex | 3f8c4045 |
1066156101 has 50 divisors (see below), whose sum is σ = 1697777862. Its totient is φ = 666694800.
The previous prime is 1066156067. The next prime is 1066156111. The reversal of 1066156101 is 1016516601.
It can be written as a sum of positive squares in only one way, i.e., 1055600100 + 10556001 = 32490^2 + 3249^2 .
It is not a de Polignac number, because 1066156101 - 27 = 1066155973 is a prime.
It is a super-2 number, since 2×10661561012 = 2273377663399044402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066156111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 49 ways as a sum of consecutive naturals, for example, 10555951 + ... + 10556051.
Almost surely, 21066156101 is an apocalyptic number.
It is an amenable number.
1066156101 is a deficient number, since it is larger than the sum of its proper divisors (631621761).
1066156101 is an frugal number, since it uses more digits than its factorization.
1066156101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189 (or 123 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The square root of 1066156101 is about 32652.0458930218. The cubic root of 1066156101 is about 1021.5828624715.
The spelling of 1066156101 in words is "one billion, sixty-six million, one hundred fifty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •