Base | Representation |
---|---|
bin | 10010111011101010011… |
… | …011111010111001111101 |
3 | 11121101010212001222201221 |
4 | 102323222123322321331 |
5 | 132303433401423401 |
6 | 2433402142233341 |
7 | 162665215452220 |
oct | 22735233727175 |
9 | 4541125058657 |
10 | 1301013311101 |
11 | 461836107889 |
12 | 19018a885851 |
13 | 958ba0152ca |
14 | 46d7dd9d5b7 |
15 | 23c97d857a1 |
hex | 12eea6fae7d |
1301013311101 has 8 divisors (see below), whose sum is σ = 1538143816320. Its totient is φ = 1076700671088.
The previous prime is 1301013311083. The next prime is 1301013311119. The reversal of 1301013311101 is 1011133101031.
It is an interprime number because it is at equal distance from previous prime (1301013311083) and next prime (1301013311119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1301013311101 - 25 = 1301013311069 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 (1301013311131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3204466081 + ... + 3204466486.
It is an arithmetic number, because the mean of its divisors is an integer number (192267977040).
Almost surely, 21301013311101 is an apocalyptic number.
It is an amenable number.
1301013311101 is a deficient number, since it is larger than the sum of its proper divisors (237130505219).
1301013311101 is an equidigital number, since it uses as much as digits as its factorization.
1301013311101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6408932603.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1301013311101 its reverse (1011133101031), we get a palindrome (2312146412132).
The spelling of 1301013311101 in words is "one trillion, three hundred one billion, thirteen million, three hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •