Base | Representation |
---|---|
bin | 10111000010010011001101… |
… | …010100100101000011110001 |
3 | 111021201102220110021211221111 |
4 | 113002103031110211003301 |
5 | 101234403244111131001 |
6 | 555250335542353321 |
7 | 30224426614064065 |
oct | 2702231524450361 |
9 | 437642813254844 |
10 | 101313133302001 |
11 | 2a310727580565 |
12 | b4431b742b841 |
13 | 446ba311157aa |
14 | 1b03820705aa5 |
15 | baa5c16c8851 |
hex | 5c24cd5250f1 |
101313133302001 has 4 divisors (see below), whose sum is σ = 101323639703152. Its totient is φ = 101302626900852.
The previous prime is 101313133301927. The next prime is 101313133302077. The reversal of 101313133302001 is 100203331313101.
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 101313133302001 - 213 = 101313133293809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101313133302401) 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, 5253186111 + ... + 5253205396.
It is an arithmetic number, because the mean of its divisors is an integer number (25330909925788).
Almost surely, 2101313133302001 is an apocalyptic number.
It is an amenable number.
101313133302001 is a deficient number, since it is larger than the sum of its proper divisors (10506401151).
101313133302001 is an equidigital number, since it uses as much as digits as its factorization.
101313133302001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10506401150.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 101313133302001 its reverse (100203331313101), we get a palindrome (201516464615102).
The spelling of 101313133302001 in words is "one hundred one trillion, three hundred thirteen billion, one hundred thirty-three million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •