Base | Representation |
---|---|
bin | 10000010011100110100… |
… | …110001001010110101111 |
3 | 10222010100202211000022200 |
4 | 100103212212021112233 |
5 | 121324401411201211 |
6 | 2214440035112543 |
7 | 143646346011060 |
oct | 20234646112657 |
9 | 3863322730280 |
10 | 1120560256431 |
11 | 3a2255062a60 |
12 | 161209442753 |
13 | 8188c574895 |
14 | 3c341d4c567 |
15 | 1e2359d8b56 |
hex | 104e69895af |
1120560256431 has 48 divisors (see below), whose sum is σ = 2040652673280. Its totient is φ = 575568639360.
The previous prime is 1120560256411. The next prime is 1120560256489. The reversal of 1120560256431 is 1346520650211.
1120560256431 is a `hidden beast` number, since 1 + 1 + 2 + 0 + 5 + 6 + 0 + 2 + 5 + 643 + 1 = 666.
It is not a de Polignac number, because 1120560256431 - 210 = 1120560255407 is a prime.
It is a super-2 number, since 2×11205602564312 (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 (1120560256411) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9022425 + ... + 9145778.
It is an arithmetic number, because the mean of its divisors is an integer number (42513597360).
Almost surely, 21120560256431 is an apocalyptic number.
1120560256431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1120560256431 is a deficient number, since it is larger than the sum of its proper divisors (920092416849).
1120560256431 is a wasteful number, since it uses less digits than its factorization.
1120560256431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18168316 (or 18168313 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 1120560256431 in words is "one trillion, one hundred twenty billion, five hundred sixty million, two hundred fifty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •