Base | Representation |
---|---|
bin | 11101011101010011101… |
… | …00111110101001111101 |
3 | 10120202120121221022111002 |
4 | 32232221310332221331 |
5 | 113040404114132224 |
6 | 2052552145540045 |
7 | 133061300511452 |
oct | 16565164765175 |
9 | 3522517838432 |
10 | 1012166552189 |
11 | 3602916a4701 |
12 | 1441b8644625 |
13 | 745a6aa6250 |
14 | 36dbc21b829 |
15 | 1b4de9359ae |
hex | eba9d3ea7d |
1012166552189 has 8 divisors (see below), whose sum is σ = 1090113335640. Its totient is φ = 934232314176.
The previous prime is 1012166552093. The next prime is 1012166552191. The reversal of 1012166552189 is 9812556612101.
It can be written as a sum of positive squares in 4 ways, for example, as 140612164 + 1012025940025 = 11858^2 + 1005995^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1012166552189 - 212 = 1012166548093 is a prime.
It is a super-2 number, since 2×10121665521892 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012166552489) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2968454 + ... + 3291815.
It is an arithmetic number, because the mean of its divisors is an integer number (136264166955).
Almost surely, 21012166552189 is an apocalyptic number.
It is an amenable number.
1012166552189 is a deficient number, since it is larger than the sum of its proper divisors (77946783451).
1012166552189 is a wasteful number, since it uses less digits than its factorization.
1012166552189 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6272719.
The product of its (nonzero) digits is 259200, while the sum is 47.
The spelling of 1012166552189 in words is "one trillion, twelve billion, one hundred sixty-six million, five hundred fifty-two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •