Base | Representation |
---|---|
bin | 101111000101111010… |
… | …1100001010111001001 |
3 | 100200000221112002121021 |
4 | 1132023311201113021 |
5 | 3124103324423423 |
6 | 114243021312441 |
7 | 10210050314116 |
oct | 1361365412711 |
9 | 320027462537 |
10 | 101130311113 |
11 | 39986473617 |
12 | 17724405721 |
13 | 96c8a43ba0 |
14 | 4c7520d90d |
15 | 296d5ab95d |
hex | 178bd615c9 |
101130311113 has 8 divisors (see below), whose sum is σ = 109603259528. Its totient is φ = 92756461824.
The previous prime is 101130311111. The next prime is 101130311123. The reversal of 101130311113 is 311113031101.
It can be written as a sum of positive squares in 4 ways, for example, as 1377300544 + 99753010569 = 37112^2 + 315837^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101130311113 - 21 = 101130311111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101130311111) 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, 24772656 + ... + 24776737.
It is an arithmetic number, because the mean of its divisors is an integer number (13700407441).
Almost surely, 2101130311113 is an apocalyptic number.
101130311113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101130311113 is a deficient number, since it is larger than the sum of its proper divisors (8472948415).
101130311113 is a wasteful number, since it uses less digits than its factorization.
101130311113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49549563.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 101130311113 its reverse (311113031101), we get a palindrome (412243342214).
The spelling of 101130311113 in words is "one hundred one billion, one hundred thirty million, three hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •