Base | Representation |
---|---|
bin | 1011111010100010001000… |
… | …0101001010100100000101 |
3 | 1201101100221222221021100112 |
4 | 2332220202011022210011 |
5 | 3204113223320012013 |
6 | 43510054154322405 |
7 | 2521313466666035 |
oct | 276504205124405 |
9 | 51340858837315 |
10 | 13100222032133 |
11 | 41a08558a6925 |
12 | 1576ab1a29405 |
13 | 740465497502 |
14 | 3340a87618c5 |
15 | 17ab7812dba8 |
hex | bea2214a905 |
13100222032133 has 2 divisors, whose sum is σ = 13100222032134. Its totient is φ = 13100222032132.
The previous prime is 13100222032127. The next prime is 13100222032141. The reversal of 13100222032133 is 33123022200131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12015526860964 + 1084695171169 = 3466342^2 + 1041487^2 .
It is a cyclic number.
It is not a de Polignac number, because 13100222032133 - 28 = 13100222031877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13100222032099 and 13100222032108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13100222032433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550111016066 + 6550111016067.
It is an arithmetic number, because the mean of its divisors is an integer number (6550111016067).
Almost surely, 213100222032133 is an apocalyptic number.
It is an amenable number.
13100222032133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100222032133 is an equidigital number, since it uses as much as digits as its factorization.
13100222032133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13100222032133 its reverse (33123022200131), we get a palindrome (46223244232264).
The spelling of 13100222032133 in words is "thirteen trillion, one hundred billion, two hundred twenty-two million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •