Base | Representation |
---|---|
bin | 1011111010100101011111… |
… | …0010111001001101000101 |
3 | 1201101110021210122221212101 |
4 | 2332221113302321031011 |
5 | 3204122100020241401 |
6 | 43510323425552101 |
7 | 2521345021620631 |
oct | 276512762711505 |
9 | 51343253587771 |
10 | 13101123212101 |
11 | 41a1178564761 |
12 | 15771037a5631 |
13 | 74057a0b4cb2 |
14 | 334152307dc1 |
15 | 17abcc2e0101 |
hex | bea57cb9345 |
13101123212101 has 4 divisors (see below), whose sum is σ = 13101151434304. Its totient is φ = 13101094989900.
The previous prime is 13101123212087. The next prime is 13101123212117. The reversal of 13101123212101 is 10121232110131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13101123212101 - 27 = 13101123211973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13101123212701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13402935 + ... + 14347156.
It is an arithmetic number, because the mean of its divisors is an integer number (3275287858576).
Almost surely, 213101123212101 is an apocalyptic number.
It is an amenable number.
13101123212101 is a deficient number, since it is larger than the sum of its proper divisors (28222203).
13101123212101 is an equidigital number, since it uses as much as digits as its factorization.
13101123212101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28222202.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 13101123212101 its reverse (10121232110131), we get a palindrome (23222355322232).
The spelling of 13101123212101 in words is "thirteen trillion, one hundred one billion, one hundred twenty-three million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •