Base | Representation |
---|---|
bin | 11110101111010000110… |
… | …01101111101011101001 |
3 | 10201222011000202102022000 |
4 | 33113220121233223221 |
5 | 114301012002104122 |
6 | 2125110155521213 |
7 | 136206531206343 |
oct | 17275031575351 |
9 | 3658130672260 |
10 | 1056166050537 |
11 | 377a10223a84 |
12 | 150837a59209 |
13 | 78799632a80 |
14 | 39193a4c293 |
15 | 1c7175e40ac |
hex | f5e866fae9 |
1056166050537 has 16 divisors (see below), whose sum is σ = 1685051249280. Its totient is φ = 649948338576.
The previous prime is 1056166050469. The next prime is 1056166050557. The reversal of 1056166050537 is 7350506616501.
1056166050537 is a `hidden beast` number, since 1 + 0 + 5 + 6 + 1 + 6 + 60 + 50 + 537 = 666.
It is not a de Polignac number, because 1056166050537 - 27 = 1056166050409 is a prime.
It is a super-2 number, since 2×10561660505372 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1056166050492 and 1056166050501.
It is not an unprimeable number, because it can be changed into a prime (1056166050557) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1504509693 + ... + 1504510394.
It is an arithmetic number, because the mean of its divisors is an integer number (105315703080).
Almost surely, 21056166050537 is an apocalyptic number.
It is an amenable number.
1056166050537 is a deficient number, since it is larger than the sum of its proper divisors (628885198743).
1056166050537 is a wasteful number, since it uses less digits than its factorization.
1056166050537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3009020109 (or 3009020103 counting only the distinct ones).
The product of its (nonzero) digits is 567000, while the sum is 45.
The spelling of 1056166050537 in words is "one trillion, fifty-six billion, one hundred sixty-six million, fifty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •