Base | Representation |
---|---|
bin | 11000100110111000… |
… | …11011010110001001 |
3 | 1021002201001111002000 |
4 | 30103130123112021 |
5 | 204024021333113 |
6 | 10022532101213 |
7 | 645245450565 |
oct | 142334332611 |
9 | 37081044060 |
10 | 13211121033 |
11 | 566a373850 |
12 | 2688464809 |
13 | 1327050ba6 |
14 | 8d48046a5 |
15 | 524c56373 |
hex | 31371b589 |
13211121033 has 32 divisors (see below), whose sum is σ = 21558650880. Its totient is φ = 7928986320.
The previous prime is 13211121031. The next prime is 13211121061. The reversal of 13211121033 is 33012111231.
13211121033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13211121033 - 21 = 13211121031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13211120997 and 13211121015.
It is not an unprimeable number, because it can be changed into a prime (13211121031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 185341 + ... + 246522.
It is an arithmetic number, because the mean of its divisors is an integer number (673707840).
Almost surely, 213211121033 is an apocalyptic number.
It is an amenable number.
13211121033 is a deficient number, since it is larger than the sum of its proper divisors (8347529847).
13211121033 is a wasteful number, since it uses less digits than its factorization.
13211121033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431986 (or 431980 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 13211121033 its reverse (33012111231), we get a palindrome (46223232264).
The spelling of 13211121033 in words is "thirteen billion, two hundred eleven million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •