Base | Representation |
---|---|
bin | 10111000010010011010001… |
… | …010111001111111111011001 |
3 | 111021201110002011212220101221 |
4 | 113002103101113033333121 |
5 | 101234403413441023001 |
6 | 555250350404012041 |
7 | 30224431366334005 |
oct | 2702232127177731 |
9 | 437643064786357 |
10 | 101313201111001 |
11 | 2a310761885460 |
12 | b443216091021 |
13 | 446ba42197c69 |
14 | 1b03829717705 |
15 | baa5c76201a1 |
hex | 5c24d15cffd9 |
101313201111001 has 32 divisors (see below), whose sum is σ = 118129787043840. Its totient is φ = 85870435795200.
The previous prime is 101313201110993. The next prime is 101313201111011. The reversal of 101313201111001 is 100111102313101.
It is not a de Polignac number, because 101313201111001 - 23 = 101313201110993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101313201111011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2602150 + ... + 14470576.
It is an arithmetic number, because the mean of its divisors is an integer number (3691555845120).
Almost surely, 2101313201111001 is an apocalyptic number.
101313201111001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101313201111001 is a deficient number, since it is larger than the sum of its proper divisors (16816585932839).
101313201111001 is a wasteful number, since it uses less digits than its factorization.
101313201111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11868885.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 101313201111001 its reverse (100111102313101), we get a palindrome (201424303424102).
The spelling of 101313201111001 in words is "one hundred one trillion, three hundred thirteen billion, two hundred one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •