Base | Representation |
---|---|
bin | 10000011100111011011… |
… | …011001000000101110111 |
3 | 11000002012121020122212200 |
4 | 100130323123020011313 |
5 | 122010403240144443 |
6 | 2223213410515543 |
7 | 144452443022202 |
oct | 20347333100567 |
9 | 4002177218780 |
10 | 1130573365623 |
11 | 3a6523211109 |
12 | 163142895bb3 |
13 | 827c6ba1b70 |
14 | 3ca11b24939 |
15 | 1e61ead5dd3 |
hex | 1073b6c8177 |
1130573365623 has 24 divisors (see below), whose sum is σ = 1758705547872. Its totient is φ = 695723266368.
The previous prime is 1130573365613. The next prime is 1130573365643. The reversal of 1130573365623 is 3265633750311.
1130573365623 is a `hidden beast` number, since 1 + 1 + 3 + 0 + 57 + 3 + 36 + 562 + 3 = 666.
It is not a de Polignac number, because 1130573365623 - 28 = 1130573365367 is a prime.
It is a super-2 number, since 2×11305733656232 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130573365613) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10676565 + ... + 10781937.
It is an arithmetic number, because the mean of its divisors is an integer number (73279397828).
Almost surely, 21130573365623 is an apocalyptic number.
1130573365623 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1130573365623 is a deficient number, since it is larger than the sum of its proper divisors (628132182249).
1130573365623 is a wasteful number, since it uses less digits than its factorization.
1130573365623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197095 (or 197092 counting only the distinct ones).
The product of its (nonzero) digits is 1020600, while the sum is 45.
The spelling of 1130573365623 in words is "one trillion, one hundred thirty billion, five hundred seventy-three million, three hundred sixty-five thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •