Base | Representation |
---|---|
bin | 10000011101111010001… |
… | …100010111101110111100 |
3 | 11000011220222211111201101 |
4 | 100131322030113232330 |
5 | 122020032333242030 |
6 | 2223510110222444 |
7 | 144520521135346 |
oct | 20357214275674 |
9 | 4004828744641 |
10 | 1131626462140 |
11 | 3a6a13700109 |
12 | 1633974b4a24 |
13 | 8293410c9b5 |
14 | 3cab1934296 |
15 | 1e6822a47ca |
hex | 1077a317bbc |
1131626462140 has 24 divisors (see below), whose sum is σ = 2394556152912. Its totient is φ = 449195235840.
The previous prime is 1131626462137. The next prime is 1131626462171. The reversal of 1131626462140 is 412646261311.
It is a self number, because there is not a number n which added to its sum of digits gives 1131626462140.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215956629 + ... + 215961868.
It is an arithmetic number, because the mean of its divisors is an integer number (99773173038).
Almost surely, 21131626462140 is an apocalyptic number.
1131626462140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1131626462140 is an abundant number, since it is smaller than the sum of its proper divisors (1262929690772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131626462140 is a wasteful number, since it uses less digits than its factorization.
1131626462140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431918637 (or 431918635 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 1131626462140 in words is "one trillion, one hundred thirty-one billion, six hundred twenty-six million, four hundred sixty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •