Base | Representation |
---|---|
bin | 10000011101010110101… |
… | …110000011001010101100 |
3 | 11000010101111221200212022 |
4 | 100131112232003022230 |
5 | 122012323003423040 |
6 | 2223331050125312 |
7 | 144500003343032 |
oct | 20352656031254 |
9 | 4003344850768 |
10 | 1131031311020 |
11 | 3a6738764286 |
12 | 163250120838 |
13 | 8286aa21180 |
14 | 3ca56890552 |
15 | 1e649de36b5 |
hex | 10756b832ac |
1131031311020 has 48 divisors (see below), whose sum is σ = 2562463366848. Its totient is φ = 416861756160.
The previous prime is 1131031310999. The next prime is 1131031311043. The reversal of 1131031311020 is 201131301311.
It is a self number, because there is not a number n which added to its sum of digits gives 1131031311020.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3760136 + ... + 4049775.
It is an arithmetic number, because the mean of its divisors is an integer number (53384653476).
Almost surely, 21131031311020 is an apocalyptic number.
1131031311020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1131031311020 is an abundant number, since it is smaller than the sum of its proper divisors (1431432055828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131031311020 is a wasteful number, since it uses less digits than its factorization.
1131031311020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7810490 (or 7810488 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1131031311020 its reverse (201131301311), we get a palindrome (1332162612331).
The spelling of 1131031311020 in words is "one trillion, one hundred thirty-one billion, thirty-one million, three hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •