Base | Representation |
---|---|
bin | 101111001011010100… |
… | …0000001010000100011 |
3 | 100200111120010100122201 |
4 | 1132112220001100203 |
5 | 3124441144233443 |
6 | 114313005114031 |
7 | 10214406010105 |
oct | 1362650012043 |
9 | 320446110581 |
10 | 101311321123 |
11 | 39a69666071 |
12 | 17774b58917 |
13 | 97273ac6bc |
14 | 4c9128b575 |
15 | 297e41434d |
hex | 1796a01423 |
101311321123 has 8 divisors (see below), whose sum is σ = 105245544320. Its totient is φ = 97418730240.
The previous prime is 101311321057. The next prime is 101311321201. The reversal of 101311321123 is 321123113101.
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 101311321123 - 217 = 101311190051 is a prime.
It is a super-2 number, since 2×1013113211232 (a number of 23 digits) contains 22 as substring.
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 101311321123.
It is not an unprimeable number, because it can be changed into a prime (101311321723) 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, 10403118 + ... + 10412851.
It is an arithmetic number, because the mean of its divisors is an integer number (13155693040).
Almost surely, 2101311321123 is an apocalyptic number.
101311321123 is a deficient number, since it is larger than the sum of its proper divisors (3934223197).
101311321123 is a wasteful number, since it uses less digits than its factorization.
101311321123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20816157.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 101311321123 its reverse (321123113101), we get a palindrome (422434434224).
The spelling of 101311321123 in words is "one hundred one billion, three hundred eleven million, three hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •