Base | Representation |
---|---|
bin | 1001000110001001000011… |
… | …0010110110001011011111 |
3 | 1022102002121202202021020022 |
4 | 2101202100302312023133 |
5 | 2302324234424111221 |
6 | 33134240430542355 |
7 | 2051361622554515 |
oct | 221422062661337 |
9 | 38362552667208 |
10 | 10001113113311 |
11 | 32064a2695581 |
12 | 11563486679bb |
13 | 57714094ab58 |
14 | 2680b0cc24b5 |
15 | 125242a194ab |
hex | 91890cb62df |
10001113113311 has 4 divisors (see below), whose sum is σ = 10001537686392. Its totient is φ = 10000688540232.
The previous prime is 10001113113283. The next prime is 10001113113319. The reversal of 10001113113311 is 11331131110001.
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 10001113113311 - 26 = 10001113113247 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10001113113311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001113113319) 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, 212251205 + ... + 212298318.
It is an arithmetic number, because the mean of its divisors is an integer number (2500384421598).
Almost surely, 210001113113311 is an apocalyptic number.
10001113113311 is a deficient number, since it is larger than the sum of its proper divisors (424573081).
10001113113311 is an equidigital number, since it uses as much as digits as its factorization.
10001113113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424573080.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 10001113113311 its reverse (11331131110001), we get a palindrome (21332244223312).
The spelling of 10001113113311 in words is "ten trillion, one billion, one hundred thirteen million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •