Base | Representation |
---|---|
bin | 111110111100111… |
… | …000000010101101 |
3 | 2201121022202101000 |
4 | 332330320002231 |
5 | 4130333124311 |
6 | 252444510513 |
7 | 35113042431 |
oct | 7674700255 |
9 | 2647282330 |
10 | 1056145581 |
11 | 4a2191897 |
12 | 25584b439 |
13 | 13aa6791a |
14 | a03a49c1 |
15 | 62ac2056 |
hex | 3ef380ad |
1056145581 has 16 divisors (see below), whose sum is σ = 1579019200. Its totient is φ = 697635504.
The previous prime is 1056145537. The next prime is 1056145583. The reversal of 1056145581 is 1855416501.
1056145581 is a `hidden beast` number, since 1 + 0 + 561 + 45 + 58 + 1 = 666.
It is not a de Polignac number, because 1056145581 - 213 = 1056137389 is a prime.
It is a super-2 number, since 2×10561455812 = 2230886976531655122, which 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 (1056145583) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 176491 + ... + 182376.
It is an arithmetic number, because the mean of its divisors is an integer number (98688700).
Almost surely, 21056145581 is an apocalyptic number.
It is an amenable number.
1056145581 is a deficient number, since it is larger than the sum of its proper divisors (522873619).
1056145581 is a wasteful number, since it uses less digits than its factorization.
1056145581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358985 (or 358979 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 36.
The square root of 1056145581 is about 32498.3935141416. The cubic root of 1056145581 is about 1018.3754676486.
The spelling of 1056145581 in words is "one billion, fifty-six million, one hundred forty-five thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •