Base | Representation |
---|---|
bin | 1011110110100100011011… |
… | …1001010101011010111101 |
3 | 1201010212011212100022112212 |
4 | 2331221012321111122331 |
5 | 3202004240233224013 |
6 | 43414512352110205 |
7 | 2513353042032662 |
oct | 275510671253275 |
9 | 51125155308485 |
10 | 13032120211133 |
11 | 4174989126831 |
12 | 1565866835365 |
13 | 736c013968ca |
14 | 330a87c9ba69 |
15 | 178ede4bb6a8 |
hex | bda46e556bd |
13032120211133 has 2 divisors, whose sum is σ = 13032120211134. Its totient is φ = 13032120211132.
The previous prime is 13032120211127. The next prime is 13032120211177. The reversal of 13032120211133 is 33111202123031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12802849703449 + 229270507684 = 3578107^2 + 478822^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13032120211133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13032120211099 and 13032120211108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13032120811133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6516060105566 + 6516060105567.
It is an arithmetic number, because the mean of its divisors is an integer number (6516060105567).
Almost surely, 213032120211133 is an apocalyptic number.
It is an amenable number.
13032120211133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13032120211133 is an equidigital number, since it uses as much as digits as its factorization.
13032120211133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13032120211133 its reverse (33111202123031), we get a palindrome (46143322334164).
The spelling of 13032120211133 in words is "thirteen trillion, thirty-two billion, one hundred twenty million, two hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •