Base | Representation |
---|---|
bin | 1001000111001111110010… |
… | …0001010000100001011011 |
3 | 1022110220122000111212002012 |
4 | 2101303330201100201123 |
5 | 2303132131134424011 |
6 | 33151100500300135 |
7 | 2052633266230421 |
oct | 221637441204133 |
9 | 38426560455065 |
10 | 10020100311131 |
11 | 32135564472a9 |
12 | 1159b673a164b |
13 | 578b78555451 |
14 | 268d92887111 |
15 | 1259a48c5a8b |
hex | 91cfc85085b |
10020100311131 has 4 divisors (see below), whose sum is σ = 10020364752552. Its totient is φ = 10019835869712.
The previous prime is 10020100311119. The next prime is 10020100311167. The reversal of 10020100311131 is 13111300102001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10020100311131 is a prime.
It is a super-2 number, since 2×100201003111312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10020100211131) 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, 132163865 + ... + 132239658.
It is an arithmetic number, because the mean of its divisors is an integer number (2505091188138).
Almost surely, 210020100311131 is an apocalyptic number.
10020100311131 is a deficient number, since it is larger than the sum of its proper divisors (264441421).
10020100311131 is an equidigital number, since it uses as much as digits as its factorization.
10020100311131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264441420.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10020100311131 its reverse (13111300102001), we get a palindrome (23131400413132).
The spelling of 10020100311131 in words is "ten trillion, twenty billion, one hundred million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •