Base | Representation |
---|---|
bin | 10111000000101011000100… |
… | …001000111101110011101011 |
3 | 111021022202021022020021102222 |
4 | 113000223010020331303223 |
5 | 101231040240342104003 |
6 | 555123123503344255 |
7 | 30213360543465602 |
oct | 2700530410756353 |
9 | 437282238207388 |
10 | 101201310113003 |
11 | 2a278264278591 |
12 | b4255a9bb208b |
13 | 446131cc99a39 |
14 | 1adc253330a39 |
15 | ba77294e6c38 |
hex | 5c0ac423dceb |
101201310113003 has 4 divisors (see below), whose sum is σ = 101201331576120. Its totient is φ = 101201288649888.
The previous prime is 101201310112939. The next prime is 101201310113177. The reversal of 101201310113003 is 300311013102101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101201310113003 - 26 = 101201310112939 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101201310113203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 239693 + ... + 14228846.
It is an arithmetic number, because the mean of its divisors is an integer number (25300332894030).
Almost surely, 2101201310113003 is an apocalyptic number.
101201310113003 is a deficient number, since it is larger than the sum of its proper divisors (21463117).
101201310113003 is an equidigital number, since it uses as much as digits as its factorization.
101201310113003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21463116.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 101201310113003 its reverse (300311013102101), we get a palindrome (401512323215104).
The spelling of 101201310113003 in words is "one hundred one trillion, two hundred one billion, three hundred ten million, one hundred thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •