Base | Representation |
---|---|
bin | 10000011101011010111… |
… | …100111001001001101100 |
3 | 11000010120110112212112221 |
4 | 100131122330321021230 |
5 | 122012444142423040 |
6 | 2223342104005124 |
7 | 144501525003103 |
oct | 20353274711154 |
9 | 4003513485487 |
10 | 1131102311020 |
11 | 3a6774848670 |
12 | 16326ba607a4 |
13 | 8287c64cbc6 |
14 | 3ca6209303a |
15 | 1e65126a74a |
hex | 1075af3926c |
1131102311020 has 96 divisors (see below), whose sum is σ = 2888083537920. Its totient is φ = 366740720640.
The previous prime is 1131102311011. The next prime is 1131102311023. The reversal of 1131102311020 is 201132011311.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1131102310985 and 1131102311003.
It is not an unprimeable number, because it can be changed into a prime (1131102311023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7887724 + ... + 8029843.
It is an arithmetic number, because the mean of its divisors is an integer number (30084203520).
Almost surely, 21131102311020 is an apocalyptic number.
1131102311020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1131102311020 is an abundant number, since it is smaller than the sum of its proper divisors (1756981226900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131102311020 is a wasteful number, since it uses less digits than its factorization.
1131102311020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15917623 (or 15917621 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1131102311020 its reverse (201132011311), we get a palindrome (1332234322331).
The spelling of 1131102311020 in words is "one trillion, one hundred thirty-one billion, one hundred two million, three hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •