Base | Representation |
---|---|
bin | 1001001100100011100100… |
… | …1111010100000010000111 |
3 | 1022210122001210220022200211 |
4 | 2103020321033110002013 |
5 | 2311130432203032221 |
6 | 33301023452020251 |
7 | 2062342525135144 |
oct | 223107117240207 |
9 | 38718053808624 |
10 | 10111313330311 |
11 | 3249202856686 |
12 | 1173782461687 |
13 | 584653779a4b |
14 | 26d5669033cb |
15 | 1280424b06e1 |
hex | 932393d4087 |
10111313330311 has 4 divisors (see below), whose sum is σ = 10262228454712. Its totient is φ = 9960398205912.
The previous prime is 10111313330269. The next prime is 10111313330323. The reversal of 10111313330311 is 11303331311101.
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 10111313330311 - 215 = 10111313297543 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 (10111313330711) 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 3 ways as a sum of consecutive naturals, for example, 75457562100 + ... + 75457562233.
It is an arithmetic number, because the mean of its divisors is an integer number (2565557113678).
Almost surely, 210111313330311 is an apocalyptic number.
10111313330311 is a deficient number, since it is larger than the sum of its proper divisors (150915124401).
10111313330311 is an equidigital number, since it uses as much as digits as its factorization.
10111313330311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150915124400.
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 10111313330311 its reverse (11303331311101), we get a palindrome (21414644641412).
The spelling of 10111313330311 in words is "ten trillion, one hundred eleven billion, three hundred thirteen million, three hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •