Base | Representation |
---|---|
bin | 101111000010101010… |
… | …0111101111111000111 |
3 | 100122202100001022202021 |
4 | 1132011110331333013 |
5 | 3123342401124221 |
6 | 114224121024011 |
7 | 10204253206105 |
oct | 1360524757707 |
9 | 318670038667 |
10 | 101021114311 |
11 | 3992a870427 |
12 | 176b3925007 |
13 | 96ac2302b0 |
14 | 4c64906c75 |
15 | 2963bdc041 |
hex | 178553dfc7 |
101021114311 has 8 divisors (see below), whose sum is σ = 109015368224. Its totient is φ = 93058774560.
The previous prime is 101021114281. The next prime is 101021114351. The reversal of 101021114311 is 113411120101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101021114311 is a prime.
It is a super-2 number, since 2×1010211143112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101021114351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7971960 + ... + 7984621.
It is an arithmetic number, because the mean of its divisors is an integer number (13626921028).
Almost surely, 2101021114311 is an apocalyptic number.
101021114311 is a deficient number, since it is larger than the sum of its proper divisors (7994253913).
101021114311 is a wasteful number, since it uses less digits than its factorization.
101021114311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15957081.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 101021114311 its reverse (113411120101), we get a palindrome (214432234412).
The spelling of 101021114311 in words is "one hundred one billion, twenty-one million, one hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •