Base | Representation |
---|---|
bin | 10011000110000101010… |
… | …110001001010000100101 |
3 | 11122110000121221102222020 |
4 | 103012011112021100211 |
5 | 132444342230400401 |
6 | 2442452315053353 |
7 | 163542410444652 |
oct | 23060526112045 |
9 | 4573017842866 |
10 | 1312202200101 |
11 | 466557a29791 |
12 | 192391a41259 |
13 | 969811067a0 |
14 | 47721d9cc29 |
15 | 242002d6d36 |
hex | 13185589425 |
1312202200101 has 16 divisors (see below), whose sum is σ = 1903612396224. Its totient is φ = 799184208384.
The previous prime is 1312202200079. The next prime is 1312202200123. The reversal of 1312202200101 is 1010022022131.
It is an interprime number because it is at equal distance from previous prime (1312202200079) and next prime (1312202200123).
It is not a de Polignac number, because 1312202200101 - 215 = 1312202167333 is a prime.
It is a super-2 number, since 2×13122022001012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312202200201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 173430291 + ... + 173437856.
It is an arithmetic number, because the mean of its divisors is an integer number (118975774764).
Almost surely, 21312202200101 is an apocalyptic number.
It is an amenable number.
1312202200101 is a deficient number, since it is larger than the sum of its proper divisors (591410196123).
1312202200101 is a wasteful number, since it uses less digits than its factorization.
1312202200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346868260.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1312202200101 its reverse (1010022022131), we get a palindrome (2322224222232).
The spelling of 1312202200101 in words is "one trillion, three hundred twelve billion, two hundred two million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •