Base | Representation |
---|---|
bin | 1001011000001011011110… |
… | …0100100000100001000101 |
3 | 1100111201111102001210120121 |
4 | 2112002313210200201011 |
5 | 2322413412313430201 |
6 | 33532450354301541 |
7 | 2112642140023555 |
oct | 226026744404105 |
9 | 40451442053517 |
10 | 10311001311301 |
11 | 3315964484329 |
12 | 11a64115878b1 |
13 | 59a428250592 |
14 | 2790ab3a3165 |
15 | 12d32d34e9a1 |
hex | 960b7920845 |
10311001311301 has 8 divisors (see below), whose sum is σ = 10573234346304. Its totient is φ = 10049279952480.
The previous prime is 10311001311287. The next prime is 10311001311307. The reversal of 10311001311301 is 10311310011301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10311001311301 - 211 = 10311001309253 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10311001311307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127878231 + ... + 127958836.
It is an arithmetic number, because the mean of its divisors is an integer number (1321654293288).
Almost surely, 210311001311301 is an apocalyptic number.
It is an amenable number.
10311001311301 is a deficient number, since it is larger than the sum of its proper divisors (262233035003).
10311001311301 is an equidigital number, since it uses as much as digits as its factorization.
10311001311301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255838091.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 10311001311301 its reverse (10311310011301), we get a palindrome (20622311322602).
The spelling of 10311001311301 in words is "ten trillion, three hundred eleven billion, one million, three hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •