Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …111001111001100111101 |
3 | 10220021101122100002200122 |
4 | 100001210233033030331 |
5 | 121020230120414123 |
6 | 2201515102504325 |
7 | 142362543166406 |
oct | 20014457171475 |
9 | 3807348302618 |
10 | 1101201732413 |
11 | 395020740382 |
12 | 1595062950a5 |
13 | 7cac5a58143 |
14 | 3b426d289ad |
15 | 1d9a122ebc8 |
hex | 10064bcf33d |
1101201732413 has 2 divisors, whose sum is σ = 1101201732414. Its totient is φ = 1101201732412.
The previous prime is 1101201732391. The next prime is 1101201732431. The reversal of 1101201732413 is 3142371021011.
Together with next prime (1101201732431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 961776412804 + 139425319609 = 980702^2 + 373397^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101201732413 - 210 = 1101201731389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101201732443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550600866206 + 550600866207.
It is an arithmetic number, because the mean of its divisors is an integer number (550600866207).
Almost surely, 21101201732413 is an apocalyptic number.
It is an amenable number.
1101201732413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101201732413 is an equidigital number, since it uses as much as digits as its factorization.
1101201732413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 1101201732413 its reverse (3142371021011), we get a palindrome (4243572753424).
The spelling of 1101201732413 in words is "one trillion, one hundred one billion, two hundred one million, seven hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •