Base | Representation |
---|---|
bin | 10111000010010001100000… |
… | …001000011110000111100101 |
3 | 111021201021011210021011022210 |
4 | 113002101200020132013211 |
5 | 101234341021130130201 |
6 | 555245434102514033 |
7 | 30224333331214632 |
oct | 2702214010360745 |
9 | 437637153234283 |
10 | 101311301411301 |
11 | 2a30a977514a03 |
12 | b442985a35919 |
13 | 446b7cb73acb7 |
14 | 1b036c92cb189 |
15 | baa5159711d6 |
hex | 5c246021e1e5 |
101311301411301 has 16 divisors (see below), whose sum is σ = 138224961326144. Its totient is φ = 65969295243264.
The previous prime is 101311301411273. The next prime is 101311301411317. The reversal of 101311301411301 is 103114103113101.
It is not a de Polignac number, because 101311301411301 - 229 = 101310764540389 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 (101311301411351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4988325 + ... + 15083301.
It is an arithmetic number, because the mean of its divisors is an integer number (8639060082884).
Almost surely, 2101311301411301 is an apocalyptic number.
It is an amenable number.
101311301411301 is a deficient number, since it is larger than the sum of its proper divisors (36913659914843).
101311301411301 is a wasteful number, since it uses less digits than its factorization.
101311301411301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10172820.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 101311301411301 its reverse (103114103113101), we get a palindrome (204425404524402).
The spelling of 101311301411301 in words is "one hundred one trillion, three hundred eleven billion, three hundred one million, four hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •