Base | Representation |
---|---|
bin | 10111000010010100001111… |
… | …011011100000001000101101 |
3 | 111021201112202202021112100101 |
4 | 113002110033123200020231 |
5 | 101234413032024204401 |
6 | 555251042002431101 |
7 | 30224466242265124 |
oct | 2702241733401055 |
9 | 437645682245311 |
10 | 101314242413101 |
11 | 2a311146649103 |
12 | b443466962491 |
13 | 446bb79b36553 |
14 | 1b038c7b36abb |
15 | baa638c5e101 |
hex | 5c250f6e022d |
101314242413101 has 8 divisors (see below), whose sum is σ = 104838744729600. Its totient is φ = 97791800613360.
The previous prime is 101314242413057. The next prime is 101314242413227.
101314242413101 is nontrivially palindromic in base 10.
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 101314242413101 - 231 = 101312094929453 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101314242413101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101314242413801) 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, 515029141 + ... + 515225818.
It is an arithmetic number, because the mean of its divisors is an integer number (13104843091200).
Almost surely, 2101314242413101 is an apocalyptic number.
It is an amenable number.
101314242413101 is a deficient number, since it is larger than the sum of its proper divisors (3524502316499).
101314242413101 is a wasteful number, since it uses less digits than its factorization.
101314242413101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030258379.
The product of its (nonzero) digits is 2304, while the sum is 28.
The spelling of 101314242413101 in words is "one hundred one trillion, three hundred fourteen billion, two hundred forty-two million, four hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •