Base | Representation |
---|---|
bin | 10000011101110110100… |
… | …000100110000111001010 |
3 | 11000011202200112101022220 |
4 | 100131312200212013022 |
5 | 122014421022430200 |
6 | 2223500021354510 |
7 | 144516140603634 |
oct | 20356640460712 |
9 | 4004680471286 |
10 | 1131564655050 |
11 | 3a6991825575 |
12 | 16337a868a36 |
13 | 8292437c35b |
14 | 3caa7645a54 |
15 | 1e67bb464a0 |
hex | 107768261ca |
1131564655050 has 96 divisors (see below), whose sum is σ = 2854435161600. Its totient is φ = 296574759360.
The previous prime is 1131564655043. The next prime is 1131564655069. The reversal of 1131564655050 is 505564651311.
It is a junction number, because it is equal to n+sod(n) for n = 1131564654993 and 1131564655011.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56267097 + ... + 56287203.
It is an arithmetic number, because the mean of its divisors is an integer number (29733699600).
Almost surely, 21131564655050 is an apocalyptic number.
1131564655050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1131564655050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1427217580800).
1131564655050 is an abundant number, since it is smaller than the sum of its proper divisors (1722870506550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131564655050 is a wasteful number, since it uses less digits than its factorization.
1131564655050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26540 (or 26535 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 42.
The spelling of 1131564655050 in words is "one trillion, one hundred thirty-one billion, five hundred sixty-four million, six hundred fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.806 sec. • engine limits •