Base | Representation |
---|---|
bin | 11110100100101101100… |
… | …010011001110111011111 |
3 | 21102212001111210221100111 |
4 | 132210231202121313133 |
5 | 233410323232020221 |
6 | 4245104253510451 |
7 | 304535545564444 |
oct | 36445542316737 |
9 | 7385044727314 |
10 | 2101003001311 |
11 | 74003746a695 |
12 | 29b2317a2427 |
13 | 12317bac20c6 |
14 | 73990bdd9cb |
15 | 399ba2dcbe1 |
hex | 1e92d899ddf |
2101003001311 has 8 divisors (see below), whose sum is σ = 2114955586784. Its totient is φ = 2087050924800.
The previous prime is 2101003001269. The next prime is 2101003001323. The reversal of 2101003001311 is 1131003001012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2101003001311 - 227 = 2100868783583 is a prime.
It is a super-2 number, since 2×21010030013112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101003001291 and 2101003001300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101003001711) 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, 11940871 + ... + 12115543.
It is an arithmetic number, because the mean of its divisors is an integer number (264369448348).
Almost surely, 22101003001311 is an apocalyptic number.
2101003001311 is a deficient number, since it is larger than the sum of its proper divisors (13952585473).
2101003001311 is a wasteful number, since it uses less digits than its factorization.
2101003001311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254481.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 2101003001311 its reverse (1131003001012), we get a palindrome (3232006002323).
The spelling of 2101003001311 in words is "two trillion, one hundred one billion, three million, one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •