Base | Representation |
---|---|
bin | 1010010010011000110110… |
… | …0001101010000110010101 |
3 | 1111001022201122212102021102 |
4 | 2210212031201222012111 |
5 | 2440304433431113023 |
6 | 40020113512155445 |
7 | 2245123462466552 |
oct | 244461541520625 |
9 | 44038648772242 |
10 | 11311023301013 |
11 | 3670a83859437 |
12 | 132819a998b85 |
13 | 640817c48087 |
14 | 2b16566d1a29 |
15 | 14935b9ab628 |
hex | a498d86a195 |
11311023301013 has 8 divisors (see below), whose sum is σ = 11429882720256. Its totient is φ = 11192298570000.
The previous prime is 11311023301007. The next prime is 11311023301021. The reversal of 11311023301013 is 31010332011311.
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 11311023301013 - 226 = 11310956192149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11311023301043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33503213 + ... + 33839138.
It is an arithmetic number, because the mean of its divisors is an integer number (1428735340032).
Almost surely, 211311023301013 is an apocalyptic number.
It is an amenable number.
11311023301013 is a deficient number, since it is larger than the sum of its proper divisors (118859419243).
11311023301013 is a wasteful number, since it uses less digits than its factorization.
11311023301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67344115.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 11311023301013 its reverse (31010332011311), we get a palindrome (42321355312324).
The spelling of 11311023301013 in words is "eleven trillion, three hundred eleven billion, twenty-three million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •