Base | Representation |
---|---|
bin | 10111000010000111000110… |
… | …010001010110011001100011 |
3 | 111021200012100020111102011102 |
4 | 113002013012101112121203 |
5 | 101234200131302104443 |
6 | 555240345355105015 |
7 | 30223456441565324 |
oct | 2702070621263143 |
9 | 437605306442142 |
10 | 101300130113123 |
11 | 2a306164618277 |
12 | b44078874216b |
13 | 446a73b1984a6 |
14 | 1b02d4978a44b |
15 | baa0aed46cb8 |
hex | 5c21c6456663 |
101300130113123 has 4 divisors (see below), whose sum is σ = 101300449917408. Its totient is φ = 101299810308840.
The previous prime is 101300130113107. The next prime is 101300130113153. The reversal of 101300130113123 is 321311031003101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101300130113123 - 24 = 101300130113107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101300130113095 and 101300130113104.
It is not an unprimeable number, because it can be changed into a prime (101300130113153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 159426536 + ... + 160060677.
It is an arithmetic number, because the mean of its divisors is an integer number (25325112479352).
Almost surely, 2101300130113123 is an apocalyptic number.
101300130113123 is a deficient number, since it is larger than the sum of its proper divisors (319804285).
101300130113123 is an equidigital number, since it uses as much as digits as its factorization.
101300130113123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319804284.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 101300130113123 its reverse (321311031003101), we get a palindrome (422611161116224).
The spelling of 101300130113123 in words is "one hundred one trillion, three hundred billion, one hundred thirty million, one hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •