Base | Representation |
---|---|
bin | 1001001101101100111010… |
… | …1111000000011111001111 |
3 | 1022212111212220022110222102 |
4 | 2103123032233000133033 |
5 | 2311441242314010411 |
6 | 33314041233505315 |
7 | 2063640441212231 |
oct | 223331657003717 |
9 | 38774786273872 |
10 | 10131001313231 |
11 | 3256596143647 |
12 | 1177557a1223b |
13 | 586470609b96 |
14 | 2704b35a8251 |
15 | 1287e5b46d3b |
hex | 936cebc07cf |
10131001313231 has 4 divisors (see below), whose sum is σ = 10144636578192. Its totient is φ = 10117366048272.
The previous prime is 10131001313161. The next prime is 10131001313233. The reversal of 10131001313231 is 13231310013101.
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-10131001313231 is a prime.
It is a super-2 number, since 2×101310013132312 (a number of 27 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 (10131001313233) 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, 6817631366 + ... + 6817632851.
It is an arithmetic number, because the mean of its divisors is an integer number (2536159144548).
Almost surely, 210131001313231 is an apocalyptic number.
10131001313231 is a deficient number, since it is larger than the sum of its proper divisors (13635264961).
10131001313231 is an equidigital number, since it uses as much as digits as its factorization.
10131001313231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13635264960.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 10131001313231 its reverse (13231310013101), we get a palindrome (23362311326332).
The spelling of 10131001313231 in words is "ten trillion, one hundred thirty-one billion, one million, three hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •