Base | Representation |
---|---|
bin | 1011110110100100000001… |
… | …1001000111001111001101 |
3 | 1201010211220021000221202202 |
4 | 2331221000121013033031 |
5 | 3202004024320214013 |
6 | 43414453453331245 |
7 | 2513350245436013 |
oct | 275510031071715 |
9 | 51124807027682 |
10 | 13032011101133 |
11 | 4174932582882 |
12 | 1565836196b25 |
13 | 736bb48b368b |
14 | 330a775b88b3 |
15 | 178ed4b17858 |
hex | bda406473cd |
13032011101133 has 32 divisors (see below), whose sum is σ = 13621682995200. Its totient is φ = 12458289263616.
The previous prime is 13032011101097. The next prime is 13032011101141. The reversal of 13032011101133 is 33110111023031.
13032011101133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13032011101133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032011001133) 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, 449009060 + ... + 449038082.
It is an arithmetic number, because the mean of its divisors is an integer number (425677593600).
Almost surely, 213032011101133 is an apocalyptic number.
It is an amenable number.
13032011101133 is a deficient number, since it is larger than the sum of its proper divisors (589671894067).
13032011101133 is a wasteful number, since it uses less digits than its factorization.
13032011101133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30161.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 13032011101133 its reverse (33110111023031), we get a palindrome (46142122124164).
The spelling of 13032011101133 in words is "thirteen trillion, thirty-two billion, eleven million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •