Base | Representation |
---|---|
bin | 10111000010100011110110… |
… | …111010100101101100101011 |
3 | 111021210011001101100001201022 |
4 | 113002203312322211230223 |
5 | 101240201402304014011 |
6 | 555302453535443055 |
7 | 30225631626032642 |
oct | 2702436672455453 |
9 | 437704041301638 |
10 | 101331011001131 |
11 | 2a31827101a51a |
12 | b44676668648b |
13 | 447061cbc4aa2 |
14 | 1b04638bb8359 |
15 | baacbae748db |
hex | 5c28f6ea5b2b |
101331011001131 has 4 divisors (see below), whose sum is σ = 101362588134600. Its totient is φ = 101299433867664.
The previous prime is 101331011001113. The next prime is 101331011001169. The reversal of 101331011001131 is 131100110133101.
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 101331011001131 - 230 = 101329937259307 is a prime.
It is a super-2 number, since 2×1013310110011312 (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 (101331011004131) 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, 15788561921 + ... + 15788568338.
It is an arithmetic number, because the mean of its divisors is an integer number (25340647033650).
Almost surely, 2101331011001131 is an apocalyptic number.
101331011001131 is a deficient number, since it is larger than the sum of its proper divisors (31577133469).
101331011001131 is an equidigital number, since it uses as much as digits as its factorization.
101331011001131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31577133468.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 101331011001131 its reverse (131100110133101), we get a palindrome (232431121134232).
The spelling of 101331011001131 in words is "one hundred one trillion, three hundred thirty-one billion, eleven million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •