Base | Representation |
---|---|
bin | 101111000010111101… |
… | …0110000011001010001 |
3 | 100122210000200120221211 |
4 | 1132011322300121101 |
5 | 3123402420120423 |
6 | 114225113220121 |
7 | 10204433334022 |
oct | 1360572603121 |
9 | 318700616854 |
10 | 101031020113 |
11 | 39935416841 |
12 | 176b7101641 |
13 | 96b12bb00a |
14 | 4c65d64c49 |
15 | 29649e710d |
hex | 1785eb0651 |
101031020113 has 4 divisors (see below), whose sum is σ = 101072411748. Its totient is φ = 100989628480.
The previous prime is 101031020063. The next prime is 101031020119. The reversal of 101031020113 is 311020130101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 31119429649 + 69911590464 = 176407^2 + 264408^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101031020113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101031020093 and 101031020102.
It is not an unprimeable number, because it can be changed into a prime (101031020119) 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, 20692156 + ... + 20697037.
It is an arithmetic number, because the mean of its divisors is an integer number (25268102937).
Almost surely, 2101031020113 is an apocalyptic number.
It is an amenable number.
101031020113 is a deficient number, since it is larger than the sum of its proper divisors (41391635).
101031020113 is an equidigital number, since it uses as much as digits as its factorization.
101031020113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41391634.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 101031020113 its reverse (311020130101), we get a palindrome (412051150214).
The spelling of 101031020113 in words is "one hundred one billion, thirty-one million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •