Base | Representation |
---|---|
bin | 10111000010010000100000… |
… | …010101100100001010110011 |
3 | 111021201011102012021211011102 |
4 | 113002100200111210022303 |
5 | 101234331323130232011 |
6 | 555245135550235015 |
7 | 30224264653562012 |
oct | 2702204025441263 |
9 | 437634365254142 |
10 | 101310231102131 |
11 | 2a30a478339877 |
12 | b4427274b5a6b |
13 | 446b68aa8466c |
14 | 1b036270baa79 |
15 | baa4a1a0273b |
hex | 5c24205642b3 |
101310231102131 has 4 divisors (see below), whose sum is σ = 101310252185064. Its totient is φ = 101310210019200.
The previous prime is 101310231102097. The next prime is 101310231102173. The reversal of 101310231102131 is 131201132013101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101310231102131 - 214 = 101310231085747 is a prime.
It is a super-2 number, since 2×1013102311021312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101310231102931) 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, 572051 + ... + 14245971.
It is an arithmetic number, because the mean of its divisors is an integer number (25327563046266).
Almost surely, 2101310231102131 is an apocalyptic number.
101310231102131 is a deficient number, since it is larger than the sum of its proper divisors (21082933).
101310231102131 is an equidigital number, since it uses as much as digits as its factorization.
101310231102131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21082932.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 101310231102131 its reverse (131201132013101), we get a palindrome (232511363115232).
The spelling of 101310231102131 in words is "one hundred one trillion, three hundred ten billion, two hundred thirty-one million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •